Interactive Identification and Optimization Using a Binary Preference Relation

Donald A. Wehrung
Additional contact information
Donald A. Wehrung: University of British Columbia, Vancouver, British Columbia

Operations Research, 1978, vol. 26, issue 2, 322-332

Abstract: This paper considers the problem in which a single decision maker must choose an element from a known nonempty choice set Y of multi-attributed elements when his preferences are uncertain. The preferences are uncertain in the sense that they are not explicitly available. The decision-maker's preferences are assumed to take the form of a binary relation on Y . We present an algorithm that requires the identification of preferences during the search process. The convergence of the adopted algorithm to a best element in Y relative to whatever preferences obtain is proved under the assumption that the identification of preferences is costless. We show that the sufficient conditions for convergence of this algorithm are weaker than the sufficient conditions for convergence of the interactive algorithm for the multiple criteria problem developed by Geoffrion, Dyer, and Feinberg.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.2.322 (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:26:y:1978:i:2:p:322-332

Access Statistics for this article

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