3
Views
3
CrossRef citations to date
0
Altmetric
Theoretical Paper

Multiobjective linear programming with context-dependent preferences

&
Pages 714-725 | Received 01 May 1996, Accepted 01 Feb 1997, Published online: 20 Dec 2017
 

Abstract

Multiobjective linear programming algorithms are typically based on value maximization. However, there is a growing body of experimental evidence showing that decision maker behavior is inconsistent with value maximization. Tversky and Simonson provide an alternative model for problems with a discrete set of choices. Their model, called the componential context model, has been shown to capture observed decision maker behavior. In this paper, an interactive multiobjective linear programming algorithm is developed which follows the rationale of Tversky and Simonson. The algorithm is illustrated with an example solved using standard linear programming software. Finally, an interactive decision support system based on this algorithm is developed to field test the usefulness of the algorithm. Results show that this algorithm compares favorably with an established algorithm in the field.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.