An Algorithm for Projecting a Reference Direction onto the Nondominated Set of Given Points
AbstractIn this paper, we consider the problem of searching nondominated alternatives in a discrete multiple criteria problem. The search procedure is based on the use of a reference direction. A reference direction reflects the desire of the decision maker (DM) to specify a search direction. To find a set of given alternatives related somehow to the reference direction specified by the DM, the reference direction has to be projected onto the set of nondominated alternatives. Our purpose is to develop an efficient algorithm for making this projection. The projection of each given reference direction determines a nondominated ordered subset. The set is provided to a decision maker for evaluation. The decision maker will choose the most preferred alternative from this subset and continues the search from this alternative with a new reference direction. The search will end when no direction of of improvement is found. A critical point in the procedure is the efficiency of the projection operation. This efficiency of our algorithm is considered theoretically and numerically. The projection is made by parametrizing an achievement scalarizing function originally proposed by Wierzbicki (1980) to project any single point onto the nondominated set.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by International Institute for Applied Systems Analysis in its series Working Papers with number ir98011.
Date of creation: Mar 1998
Date of revision:
Contact details of provider:
Postal: A-2361 Laxenburg
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Korhonen, Pekka J. & Laakso, Jukka, 1986. "A visual interactive method for solving the multiple criteria problem," European Journal of Operational Research, Elsevier, vol. 24(2), pages 277-287, February.
- Stanley Zionts & Jyrki Wallenius, 1976. "An Interactive Programming Method for Solving the Multiple Criteria Problem," Management Science, INFORMS, vol. 22(6), pages 652-663, February.
- Korhonen, Pekka, 1988. "A visual reference direction approach to solving discrete multiple criteria problems," European Journal of Operational Research, Elsevier, vol. 34(2), pages 152-159, March.
- Odile Marcotte & Richard M. Soland, 1986. "An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization," Management Science, INFORMS, vol. 32(1), pages 61-75, January.
- Korhonen, Pekka J., 1986. "A hierarchical interactive method for ranking alternatives with multiple qualitative criteria," European Journal of Operational Research, Elsevier, vol. 24(2), pages 265-276, February.
- Pekka Korhonen & Jyrki Wallenius & Stanley Zionts, 1984. "Solving the Discrete Multiple Criteria Problem using Convex Cones," Management Science, INFORMS, vol. 30(11), pages 1336-1345, November.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).
If references are entirely missing, you can add them using this form.