Abstract
The method is based on a well-known method for unconstrained optimization developed by Nelder and Mead. It is assumed that the decision maker’s utility is not an explicitly known concave function of several objectives, which are linear functions of activities defined on a convex polyhedral set. It has thus been possible to modify the simplex procedure to handle constraints. Furthermore, in the interaction with the decision maker, the method only relies on a simple ranking procedure. The method seems to have many good properties. However, its advantages still have to be empirically verified.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aubin, J.P. and Näslund, B., “An Exterior Branching Algorithm”, Working Paper 72–6, European Institute for Advanced Studies in Management, February, 1972
Belenson, S.M. and Kapur, K.C., “An Algorithm for Solving Multicriterion Linear Programming Problems with Examples”, Operational Research Quarterly, Vol. 24, No. 1, March, 1973.
Benayoun, R., de Montgolfier, J. and Tergny, J., “Linear Programming with Multiple Objective Functions: step method (stem)”, paper presented at the Seventh International Symposium on Mathematical Programming, The Hague, Holland, September 14–18, 1970.
Geoffrion, A.M., “Vector Maximal Decomposition Programming”, Working Paper 164, UCLA, September, 1970.
Geoffrion, A., Dyer, J.S, and Feinberg, A., “An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department”, Management Science, Vol. 19, 1972, pp. 357–368.
Hemming, T., “A Multiobjective Decision Procedure for a Special Class of Problems”, Working Paper No. 6030, Stockholm School of Economics, 1975.
Hemming, T., “A New Method for Multiobjective Optimization”, Working Paper No. 6031, Stockholm School of Economics, 1975.
Nelder, N. and Mead, R. “A Simplex Method for Function Minimization”, The Commuter Journal, Vol. 7, 1965, pp. 308–313.
Parkinson, J.M. and Hutchinson, D. Chapters 7 and 8 in Numerical Methods for Non-Linear Optimization, Lootsma, F.A. (editor) Academic Press, London, 1972.
Rudemo, M, and Stenviken, B. “Optimization Routines for FOA Hybrid Computer EAI 640/8800”, FOA Report, C. 2434–54, 1970.
Sellstedt, B. and Näslund, B., “Product Development Plans”, Operational Research Quarterly, Vol. 23, pp. 297–310, 1972.
Zionts, S. and Wallenius, J., “An Interactive Ptogramming Method for Solving the Multiple Criteria Problem”, Working Paper No. 74–10, Revised, March, 1975, European Institute for Advanced Studies in Management.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hemming, T. (1976). A New Method for Interactive Multiobjective Optimization: A Boundary Point Ranking Method. In: Thiriez, H., Zionts, S. (eds) Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol 130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-87563-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-87563-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07794-7
Online ISBN: 978-3-642-87563-2
eBook Packages: Springer Book Archive