Abstract
The article pertains to characterize strict local efficient solution (s.l.e.s.) of higher order for the multiobjective programming problem (MOP) with inequality constraints. To create the necessary framework, we partition the index set of objectives of MOP to give rise to subproblems. The s.l.e.s. of order m for MOP is related to the local efficient solution of a subproblem. This relationship inspires us to adopt the D.C. optimization approach, the convex subdifferential sum rule, and the notion of ε-subdifferential to derive the necessary and sufficient optimality conditions for s.l.e.s. of order \({m \geqq 1}\) for the convex MOP. Further, the saddle point criteria of higher order are also presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Auslender A.: Stability in mathematical programming with nondifferentiable data. SIAM J. Control Optim. 22, 239–254 (1984)
Chinchuluun A., Pardalos P.M.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 154(1), 29–50 (2007)
Ehrgott M., Wiecek M.M.: Saddle points and Pareto points in multiobjective programming. J. Glob. Optim. 32, 11–33 (2005)
Gadhi N., Metrane A.: Sufficient optimality condition for vector optimization problems under D.C. data. J. Global Optim. 28, 55–66 (2004)
Gadhi N., Laghdir M., Metrane A.: Optimality condition for D.C. vector optimization problems under reverse convex constraints. J. Glob. Optim. 33, 527–540 (2005)
Ginchev I., Guerraggio A., Rocca M.: Isolated minimizers and proper efficiency for C 0,1 constrained vector optimization problems. J. Math. Anal. Appl. 309, 353–368 (2005)
Ginchev I., Guerraggio A., Rocca M.: From scalar to vector optimization. Appl. Math. 51, 5–36 (2006)
Gupta A., Mehra A., Bhatia D.: Higher order efficiency, saddle point optimality and duality for vector optimization problems. Numer. Funct. Anal. Optim. 28, 339–352 (2007)
Jiménez B.: Strict efficiency in vector optimization. J. Math. Anal. Appl. 265, 264–284 (2002)
Jiménez B.: Strict minimality conditions in nondifferentiable multiobjective programming. J. Optim. Theor. Appl. 116(1), 99–116 (2003)
Jiménez B., Novo V.: First and second order sufficient conditions for strict minimality in nonsmooth vector optimization. J. Math. Anal. Appl. 284, 496–510 (2003)
Rockafeller R.T.: Convex analysis. Princeton University Press, New Jersey (1970)
Rooyen M.V., Zhou X., Zlobec S.: A saddle-point characterization of Pareto Optima. Math. Program. 67, 77–88 (1994)
Studniarski M.: Necessary and sufficient conditions for isolated local minima of nonsmooth functions. SIAM J. Control Optim. 24, 1044–1049 (1986)
Taa A.: Optimality conditions for vector optimization problems of a difference of convex mappings. J. Global Optim. 31, 421–436 (2005)
Ward D.E.: Characterization of strict local minima and necessary conditions for weak sharp minima. J. Optim. Theor. Appl. 80, 551–571 (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gupta, A., Mehra, A. & Bhatia, D. Characterizing strict efficiency for convex multiobjective programming problems. J Glob Optim 49, 265–280 (2011). https://doi.org/10.1007/s10898-010-9543-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-010-9543-7
Keywords
- Multiobjective programming problem
- Strict local efficientsolution
- D. C. optimization
- Convex subdifferential
- Saddle pointof higher order