Solving the Discrete Multiple Criteria Problem using Convex Cones

Pekka Korhonen, Jyrki Wallenius and Stanley Zionts
Additional contact information
Stanley Zionts: School of Management, State University of New York, Buffalo, New York 14214

Management Science, 1984, vol. 30, issue 11, 1336-1345

Abstract: An interactive method employing pairwise comparisons of attainable solutions is developed for solving the discrete, deterministic multiple criteria problem assuming a single decision maker who has an implicit quasi-concave increasing utility (or value) function. The method chooses an arbitrary set of positive multipliers to generate a proxy composite linear objective function which is then maximized over the set of solutions. The maximizing solution is compared with several solutions using pairwise judgments asked of the decision maker. Responses are used to eliminate alternatives using convex cones based on expressed preferences, and then a new set of weights is found that satisfies the indicated preferences. The requisite theory and proofs as well as a detailed numerical example are included. In addition, the results of some computational experiments to test the effectiveness of the method are described.

Keywords: decision analysis; utility/preference: multiattribute; programming: multiple criteria; convex cones (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (49)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.30.11.1336 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:30:y:1984:i:11:p:1336-1345

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().