Abstract
In this paper, we use an algebraic type of closure, which is called vector closure, and through it we introduce some adaptations to the proper efficiency in the sense of Hurwicz, Benson, and Borwein in real linear spaces without any particular topology. Scalarization, multiplier rules, and saddle-point theorems are obtained in order to characterize the proper efficiency in vector optimization with and without constraints. The usual convexlikeness concepts used in such theorems are weakened through the vector closure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Borwein, J. M., Proper Efficient Points for Maximization with Respect to Cones, SIAM Journal on Control and Optimization, Vol. 15, pp. 57–63, 1977.
Jahn, J., Scalarization in Multiobjective Optimization, Mathematics of Multiobjective Optimization, Edited by P. Serafini, Springer Verlag, Berlin, Germany, pp. 45–88, 1985.
Khanh, P. Q., Proper Solutions of Vector Optimization Problems, Journal of Optimization Theory and Applications, Vol. 74, pp. 105–130, 1992.
Chen, G. Y., and Rong, W. D., Characterizations of the Benson Proper Efficiency for Nonconvex Vector Optimization, Journal of Optimization Theory and Applications, Vol. 98, pp. 365–384, 1998.
Rong, W., Proper Efficiency of Nonconvex Vector Optimization Problems, Systems Science and Mathematical Sciences, Vol. 11, pp. 18–25, 1998.
Wang, S., and Li, Z., Scalarization and Lagrange Duality in Multiobjective Optimization, Optimization, Vol. 26, pp. 315–324, 1992.
Li, Z. F., and Wang, S. Y., Lagrange Multipliers and Saddle Points in Multiobjective Programming, Journal of Optimization Theory and Applications, Vol. 83, pp. 63–81, 1994.
Yang, X., Generalized Subconvexlike Functions and Multiple-Objective Optimization, Systems Science and Mathematical Sciences, Vol. 8, pp. 254–259, 1995.
Adan, M., and Novo, V., Partial and Generalized Subconvexity in Vector Optimization Problems, Journal of Convex Analysis, Vol. 8, pp. 583–594, 2001.
Adan, M., and Novo, V., Optimality Conditions for Vector Optimization Problems with Generalized Convexity in Real Linear Spaces, Optimization, Vol. 51, pp. 73–91, 2002.
Adan, M., and Novo, V., Weak Efficiency in Vector Optimization Using a Closure of Algebraic Type under Cone-Convexlikeness, European Journal of Operational Research, Vol. 149, pp. 641–653, 2003.
Breckner, W. W., and Kassay, G., A Systematization of Convexity Concepts for Sets and Functions, Journal of Convex Analysis, Vol. 4, pp. 109–127, 1997.
Frenk, J. B. G., and Kassay, G., On Classes of Generalized Convex Functions, Gordan-Farkas Type Theorems, and Lagrangian Duality, Journal of Optimization Theory and Applications, Vol. 102, pp. 315–343, 1999.
Holmes, R. B., Geometric Functional Analysis and Its Applications, Springer Verlag, New York, NY, 1975.
Bazaraa, M. S., and Shetty, C. M., Foundations of Optimization, Lectures Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Germany, Vol. 122, 1976.
Hurwicz, L., Programming in Linear Spaces, Studies in Linear and Nonlinear Programming, Edited by K. J. Arrow, L. Hurwicz, and H. Uzawa, Stanford University Press, Stanford, California, 1958.
Benson, H. P., Efficiency and Proper Efficiency in Vector Maximization with Respect to Cones, Journal of Mathematical Analysis and Applications, Vol. 93, pp. 273–289, 1983.
Borwein, J. M., The Geometry of Pareto Efficiency over Cones, Mathematische Operationforschung und Statistik, Serie Optimization, Vol. 11, pp. 235–248, 1980.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Adán, M., Novo, V. Proper Efficiency in Vector Optimization on Real Linear Spaces. Journal of Optimization Theory and Applications 121, 515–540 (2004). https://doi.org/10.1023/B:JOTA.0000037602.13941.ed
Issue Date:
DOI: https://doi.org/10.1023/B:JOTA.0000037602.13941.ed