An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization

Odile Marcotte and Richard M. Soland
Additional contact information
Odile Marcotte: Département de mathématique et d'informatique, Université du Québec à Montréal, C.P. 8888, Succ. A, Montréal, Québec, Canada H3C 3P8
Richard M. Soland: Department of Operations, School of Engineering and Applied Science, The George Washington University, Washington, D.C. 20052

Management Science, 1986, vol. 32, issue 1, 61-75

Abstract: We present a new interactive algorithm for multiple criteria optimization. The algorithm is of the branch-and-bound type, and differs from previous interactive algorithms in several ways. First, the field of application is wider because it applies to two important classes of multiple criteria decision problems: those for which the feasible set is convex and those for which the feasible set is discrete. Secondly, the algorithm does not require a great deal from the decision maker; he is merely required to indicate his preference between two vectors whenever the algorithm so demands.

Keywords: multicriteria; optimization (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.1.61 (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:32:y:1986:i:1:p:61-75

Access Statistics for this article

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