A Separating Choice Hyperplane Algorithm for Evaluating Multiattribute Decisions

Ted Dintersmith
Additional contact information
Ted Dintersmith: Analog Devices, Inc., Norwood, Massachusetts

Operations Research, 1984, vol. 32, issue 6, 1328-1344

Abstract: This paper presents an iterative algorithm for optimizing multiattribute decisions. It develops a separating choice hyperplane algorithm, which allows decision-makers to identify their most preferred point from a nonlinear convex set of feasible outcomes. In this interactive algorithm, the decision-maker reveals information about preferences by solving a series of elementary resource allocations. The resulting structure integrates a theoretically rigorous optimization procedure with intuitive assessment tasks. A practical application of the approach is presented.

Keywords: 91 decision analysis: multiattribute; 641 multiple criteria programming: interactive algorithms; 644 nonlinear programming using cutting planes: interactive multiattribute (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.6.1328 (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:oropre:v:32:y:1984:i:6:p:1328-1344

Access Statistics for this article

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