Levitin–Polyak well-posedness for constrained quasiconvex vector optimization problems
- 361 Downloads
In this paper, a notion of Levitin–Polyak (LP in short) well-posedness is introduced for a vector optimization problem in terms of minimizing sequences and efficient solutions. Sufficient conditions for the LP well-posedness are studied under the assumptions of compactness of the feasible set, closedness of the set of minimal solutions and continuity of the objective function. The continuity assumption is then weakened to cone lower semicontinuity for vector-valued functions. A notion of LP minimizing sequence of sets is studied to establish another set of sufficient conditions for the LP well-posedness of the vector problem. For a quasiconvex vector optimization problem, sufficient conditions are obtained by weakening the compactness of the feasible set to a certain level-boundedness condition. This in turn leads to the equivalence of LP well-posedness and compactness of the set of efficient solutions. Some characterizations of LP well-posedness are given in terms of the upper Hausdorff convergence of the sequence of sets of approximate efficient solutions and the upper semicontinuity of an approximate efficient map by assuming the compactness of the set of efficient solutions, even when the objective function is not necessarily quasiconvex. Finally, a characterization of LP well-posedness in terms of the closedness of the approximate efficient map is provided by assuming the compactness of the feasible set.
KeywordsLevitin–Polyak well-posedness Quasiconvexity Efficiency Upper semicontinuity Hausdorff convergence
Mathematics Subject Classification49K40 90C26 90C29
The authors are really grateful to the reviewers for the valuable comments and suggestions which helped in improving the paper.
- 1.Bednarczuk, E.: Well-posedness of vector optimization problems. In: Jahn, J., Krabs, W. (eds.), Recent Advances and Historical Development of Vector Optimization Problems, Lecture Notes in Econom. and Math. Systems, vol. 294, pp. 51–61. Springer, Berlin (1987)Google Scholar
- 2.Bednarczuk, E.: An approach to well-posedness in vector optimization consequences to stability. Parametric optimization. Control Cybern. 23, 107–122 (1994)Google Scholar
- 6.Dontchev, A.L., Zolezzi, T.: Well-Posed Optimization Problems, vol. 1543. Springer, Berlin (1993)Google Scholar
- 13.Lalitha, C.S., Chatterjee, P.: Well-posedness and stability in vector optimization using Henig proper efficiency. Optimization. 62, 155–165 (2013)Google Scholar
- 14.Levitin, E.S., Polyak, B.T.: Convergence of minimizing sequences in conditional extremum problems. Sov. Math. Dokl. 7, 764–767 (1966)Google Scholar
- 15.Loridan, P. (1995) Well-posedness in vector optimization. In: Lucchetti, R., Revalski, J. (eds.) Recent Developments in Well-Posed Variational Problems. Math. Appl. vol. 331, pp. 171–192. Kluwer, DordrechtGoogle Scholar
- 16.Luc, D.T.: Theory of Vector Optimization. Lecture Notes in Econom, and Math, Systems, vol. 319. Springer, Berlin (1989)Google Scholar
- 17.Lucchetti, R.: Convexity and Well-Posed Problems. CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC. vol. 22. Springer, New York (2006)Google Scholar
- 22.Todorov, M. et al.: Well-posedness in the linear vector semi-infinite optimization. Multiple criteria decision making expand and enrich the domains of thinking and applications. In: Yu, P.L. (ed.) Proceedings of the Tenth International Conference, pp. 141–150. Springer, New York (1994)Google Scholar