Abstract
Using the notion of invexity, we give sufficient conditions of optimality for properly efficient solutions of a vector infinite programming problem and show that the set of properly efficient solutions coincides with the set of optimal solutions of a related scalar problem.
Similar content being viewed by others
References
Ben-Tal A., Zowe J.: A unified theory of first and second order conditions for extremum problems in topological vector spaces. Math. Program. Study 19, 39–76 (1982)
Craven B.D.: Mathematical Programming and Control Theory. Chapman and Hall, London (1978)
Geoffrion A.M.: Proper effciency and the theory of vector maximization. J. Math. Anal. Appl. 22, 618–630 (1968)
Guignard M.: Generalized Kuhn–Tucker conditions for mathematical programming problems in a Banach space. SIAM J. Control 2, 232–241 (1969)
Luenberger D.: Optimization by Vector Space Methods. Wiley, New York (1969)
de Oliveira V.A., Rojas-Medar M.A.: Multi-objective infinite programming. Comput. Math. Appl. 55, 1907–1922 (2008)
Robinson S.M.: First order conditions for general nonlinear optimization. SIAM J. Appl. Math. 30, 597–607 (1976)
Schirotzek W.: Nonasymptotic necessary conditions for nonsmooth infinite optimization problems. J. Math. Anal. App. 118, 535–546 (1986)
Tapia R.A., Trosset M.W.: An extension of the Karush–Kuhn–Tucker necessity conditions to infinite programming. SIAM Rev. 36, 1–17 (1994)
Varaiya P.D.: Nonlinear programming in Banach spaces. SIAM J. Appl. Math. 15, 285–293 (1976)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
de Oliveira, V.A., Rojas-Medar, M.A. Proper efficiency in vector infinite programming problems. Optim Lett 3, 319–328 (2009). https://doi.org/10.1007/s11590-008-0111-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-008-0111-8