Generalized B-Well-Posedness for Set Optimization Problems
- 538 Downloads
This paper aims at studying the generalized well-posedness in the sense of Bednarczuk for set optimization problems with set-valued maps. Three kinds of B-well-posedness for set optimization problems are introduced. Some relations among the three kinds of B-well-posedness are established. Necessary and sufficient conditions of well-posedness for set optimization problems are obtained.
KeywordsB-Well-posedness Set optimization problem u-Minimal solution Hausdorff convergence Generalized B-minimizing sequence
The authors would like to thank the editor and anonymous referees for their valuable comments and suggestions. This work was supported by the National Natural Science Foundation of China (11001287 and 11171363), the Natural Science Foundation Project of Chongqing (CSTC 2010BB9254 and CSTC 2009BB8240), the Education Committee Project Research Foundation of Chongqing (No. KJ100711), and the Special Fund of Chongqing Key Laboratory (CSTC 2011KLORSE01).
- 5.Kuroiwa, D.: Some duality theorems of set-valued optimization with natural criteria. In: Proceedings of the International Conference on Nonlinear Analysis and Convex Analysis, pp. 221–228. World Scientific, River Edge (1999) Google Scholar
- 28.Bednarczuck, E.M.: An approach to well-posedness in vector optimization: consequences to stability and parametric optimization. Control Cybern. 23, 107–122 (1994) Google Scholar
- 38.Kuratowski, K.: Topology, Vols. 1 and 2. Academic Press, New York (1968) Google Scholar