Abstract
In the paper, we establish necessary and sufficient optimality conditions for quasi-relative efficient solutions of a constrained set-valued optimization problem using the Lagrange multipliers. Many examples are given to show that our results and their applications are more advantageous than some existing ones in the literature.
Similar content being viewed by others
References
Anh NLH (2014) Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality. Positivity 18:449–473
Anh NLH, Khanh PQ (2013) Higher-order optimality conditions in set-valued optimization using radial sets and radial derivatives. J Glob Optim 56:519–536
Anh NLH, Khanh PQ, Tung LT (2011) Higher-order radial derivatives and optimality conditions in nonsmooth vector optimization. Nonlinear Anal TMA 74:7365–7379
Bao TQ, Mordukhovich BS (2010) Relative Pareto minimizers to multiobjective problems: existence and optimality conditions. Math Program Ser A 122:301–347
Bao TQ, Mordukhovich BS (2012) Extended Pareto optimality in multiobjective problems. In: Ansari QH, Yao J-C (eds) Recent developments in vector optimization. Springer, Berlin, pp 467–515
Borwein JM, Lewis AS (1992a) Partially finite convex programming, part I: quasi relative interiors and duality theory. Math Program 57:15–48
Borwein JM, Lewis AS (1992b) Partially finite convex programming, part II: explicit lattice models. Math Program 57:49–83
Boţ RI, Csetnek ER, Wanka G (2008a) Regularity conditions via quasi-relative interior in convex programming. SIAM J Optim 19:217–233
Boţ RI, Csetnek ER, Moldovan A (2008b) Revisiting some duality theorems via the quasi-relative interior in convex optimization. J Optim Theory Appl 139:67–84
Cammaroto F, Di Bella B (2005) Separation theorem based on the quasi-relative interior and application to duality theory. J Optim Theory Appl 125:223–229
Corley HW (1988) Optimality conditions for maximization of set-valued functions. J Optim Theory Appl 58:1–10
Daniele P, Giuffrè S, Idone G, Maugeri A (2007) Infinite dimensional duality and applications. Math Ann 339:221–239
De Araujo AP, Monteiro PK (1990) On programming when the positive cone has an empty interior. J Optim Theory Appl 67:395–410
Durea M (2008) Optimality conditions for weak and firm efficiency in set-valued optimization. J Math Anal Appl 344:1018–1028
Gong X-H, Dong H-B, Wang S-Y (2003) Optimality conditions for proper efficient solutions of vector set-valued optimization. J Math Anal Appl 284:332–350
Gowda MS, Teboulle M (1990) A comparison of constraint qualifications in infinite-dimensional convex programming. SIAM J Control Optim 28:925–935
Ha TXD (2012) Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems. Nonlinear Anal TMA 75:1305–1323
Holmes RB (1975) Geometric functional analysis. Springer, Berlin
Hurwicz L (1958) Programming in linear spaces. In: Arrow KJ, Hurwicz L, Uzawa H (eds) Studies in linear and non-linear programming. Standford University Press, Standford, pp 38–102
Hurwicz L, Uzawa H (1958) A note on the Lagrangian saddle-points. In: Arrow KJ, Hurwicz L, Uzawa H (eds) Studies in linear and non-linear programming. Standford University Press, Standford, pp 103–113
Jahn J, Khan AA (2002) Generalized contingent epiderivatives in set-valued optimization: optimality conditions. Numer Funct Anal Optim 23:807–831
Jeyakumar V, Wolkowicz H (1992) Generalizations of Slater’s constraint qualification for infinite convex programs. Math Program 57:85–101
Khanh PQ, Tuan ND (2008) Variational sets of multivalued mappings and a unified study of optimality conditions. J Optim Theory Appl 139:45–67
Li SJ, Chen CR (2006) Higher-order optimality conditions for Henig efficient solutions in set-valued optimization. J Math Anal Appl 323:1184–1200
Li SJ, Teo KL, Yang XQ (2008) Higher-order optimality conditions for set-valued optimization. J Optim Theory Appl 137:533–553
Liu B, Wang K (2014) Second-order modified contingent epiderivatives in set-valued optimization. Numer Funct Anal Optim 35:50–67
Wang QL, Li SJ (2009) Higher-order weakly generalized adjacent epiderivatives and applications to duality of set-valued optimization. J Inequal Appl 2009:462637
Wang QL, Li SJ, Teo KL (2010) Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization. Optim Lett 4:425–437
Zǎlinescu C (1999) A comparison of constraint qualifications in infinite-dimensional convex programming revisited. J Aust Math Soc Ser B 40:353–378
Zǎlinescu C (2002) Convex analysis in general vector spaces. World Scientific, Singapore
Zhou ZA, Yang XM (2011) Optimality conditions of generalized subconvexlike set-valued optimization problems based on the quasi-relative interior. J Optim Theory Appl 150:327–340
Acknowledgments
This research was supported by the project of the Moravian-Silesian Region (Czech Republic) Reg. No. 02692/2014/RRC. The author is grateful to an anonymous referee for his valuable comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Anh, N.L.H. On optimality conditions for quasi-relative efficient solutions in set-valued optimization. TOP 24, 259–272 (2016). https://doi.org/10.1007/s11750-015-0399-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-015-0399-3