Abstract
In this paper, we consider an optimization problem which aims to minimize a convex function over the efficient set of a multi-objective programming problem constrained by a compact convex set X. In case when X is not a polytope, From a computational viewpoint, we may compromise our aim by getting an approximate solution of such a problem. To find an approximate solution, we propose an outer approximation method for a dual problem.
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., Applied Abstract Analysis, John Wiley, New York (1977).
Hestenes, M.R., Optimization Theory: The Finite Dimensional Case, John Wiley, New York (1975).
Hogan, W.W., “Point-To-Set Maps in Mathematical Programming”, SIAM Review, Vol. 15, No. 3 (1973).
Horst, R. and H. Tuy, Global Optimization, Springer-Verlag, Berlin (1990).
Konno, H., P.T. Thach and H. Tuy, Optimization on Low Rank Nonconvex Structures Kluwer Academic Publishers, Dordrecht (1997).
Rockafellar, R.T., Convex Analysis Princeton University Press, Princeton, N.J. (1970).
Sawaragi, Y., H. Nakayama and T. Tanino, Theory of Multiobjective Optimization, Academic Press, Orland (1985).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamada, S., Tanino, T., Inuiguchi, M. (2000). An Outer Approximation Method for Optimization over the Efficient Set. In: Haimes, Y.Y., Steuer, R.E. (eds) Research and Practice in Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol 487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57311-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-57311-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67266-1
Online ISBN: 978-3-642-57311-8
eBook Packages: Springer Book Archive