Connectedness of the approximate solution sets for set optimization problems

References

• Khan AA, Tammer C, Zălinescu C. Set-valued optimization. Heidelberg: Springer; 2015.
   Google Scholar
• Gerstewitz (Tammer) C. Nichtkonvexe Dualität in der Vektoroptimierung. Wiss Zeitschr der TH Leuna-Merseburg. 1983;25:357–364.
   Google Scholar
• Hiriart-Urruty JB. Tangent cones, generalized gradients and mathematical programming in Banach spaces. Math Oper Res. 1979;4:79–97.
   Google Scholar
• Hiriart-Urruty JB. New concepts in nondifferentiable programming. Bull Soc Math France Mém. 1979;60:57–85.
   Google Scholar
• Hamel A, Löhne A. Minimal set theorems. Report 11, University Halle-Wittenberg, Institute of Optimization and Stochastics; 2002.
   Google Scholar
• Hernández E, Rodríguez-Marín L. Nonconvex scalarization in set optimization with set-valued maps. J Math Anal Appl. 2007;325:1–18.
   Web of Science ®Google Scholar
• Han Y, Huang NJ. Continuity and convexity of a nonlinear scalarizing function in set optimization problems with applications. J Optim Theory Appl. 2018;177:679–695.
   Web of Science ®Google Scholar
• Han Y. Nonlinear scalarizing functions in set optimization problems. Optimization. 2019;68:1685–1718.
   Web of Science ®Google Scholar
• Han Y. A Hausdorff-type distance, the Clarke generalized directional derivative and applications in set optimization problems. Appl Anal. doi:10.1080/00036811.2020.1778673
   Web of Science ®Google Scholar
• Luc DT. Theory of vector optimization. Berlin: Springer; 1989. (Lecture notes in economics and mathematical systems; vol. 319).
   Google Scholar
• Gong XH. Connectedness of efficient solution sets for set-valued maps in normed spaces. J Optim Theory Appl. 1994;83:83–96.
   Web of Science ®Google Scholar
• Gong XH. Connectedness of super efficient solution sets for set-valued maps in Banach spaces. Math Methods Oper Res. 1996;44:135–145.
   Google Scholar
• Gong XH. Efficiency and Henig efficiency for vector equilibrium problems. J Optim Theory Appl. 2001;108:139–154.
   Web of Science ®Google Scholar
• Gong XH. Connectedness of the solution sets and scalarization for vector equilibrium problems. J Optim Theory Appl. 2007;133:151–161.
   Web of Science ®Google Scholar
• Gong XH, Yao JC. Connectedness of the set of efficient solutions for generalized systems. J Optim Theory Appl. 2008;138:189–196.
   Web of Science ®Google Scholar
• Gong XH. On the contractibility and connectedness of an efficient point set. J Math Anal Appl. 2001;264:465–478.
   Web of Science ®Google Scholar
• Han Y, Huang NJ. The connectedness of the solutions set for generalized vector equilibrium problems. Optimization. 2016;65:357–367.
   Web of Science ®Google Scholar
• Han Y, Huang NJ. Some characterizations of the approximate solutions to generalized vector equilibrium problems. J Ind Manag Optim. 2016;12:1135–1151.
   Web of Science ®Google Scholar
• Han Y, Huang NJ, Yao JC. Connectedness and stability of the approximate solutions to generalized vector quasi-equilibrium problems. J Nonlinear Convex Anal. 2017;18:1079–1101.
   Web of Science ®Google Scholar
• Han Y, Huang NJ. Existence and connectedness of solutions for generalized vector quasi-equilibrium problems. J Optim Theory Appl. 2018;179:65–85.
   Web of Science ®Google Scholar
• Benoist J. Contractibility of the efficient set in strictly quasiconcave vector maximization. J Optim Theory Appl. 2001;110:325–336.
   Web of Science ®Google Scholar
• Popovici N. Structure of efficient sets in lexicographic quasiconvex multicriteria optimization. Oper Res Lett. 2006;34:142–148.
   Web of Science ®Google Scholar
• Li ZF, Wang SY. Connectedness of super efficient sets in vector optimization of set-valued maps. Math Meth Oper Res. 1998;48:207–217.
   Web of Science ®Google Scholar
• Qiu QS, Yang XM. Connectedness of Henig weakly efficient solution set for set-valued optimization problems. J Optim Theory Appl. 2012;152:439–449.
   Web of Science ®Google Scholar
• Sun EJ. On the connectedness of the efficient set for strictly quasiconvex vector minimization problems. J Optim Theory Appl. 1996;89:475–481.
   Web of Science ®Google Scholar
• Peng ZY, Wang ZY, Yang XM. Connectedness of solution sets for weak generalized symmetric Ky Fan inequality problems via addition-invariant sets. J Optim Theory Appl. 2020;185:188–206.
   Web of Science ®Google Scholar
• Gong XH. Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior. J Math Anal Appl. 2005;307:12–31.
   Web of Science ®Google Scholar
• Han Y, Wang SH, Huang NJ. Arcwise connectedness of the solution sets for set optimization problems. Oper Res Lett. 2019;47:168–172.
   Web of Science ®Google Scholar
• Han Y. Connectedness of weak minimal solution set for set optimization problems. Oper Res Lett. 2020;48:820–826.
   Web of Science ®Google Scholar
• Han Y, Zhang K, Huang NJ. The stability and extended well-posedness of the solution sets for set optimization problems via the Painlevé–Kuratowski convergence. Math Methods Oper Res. 2020;91:175–196.
   Web of Science ®Google Scholar
• Göpfert A, Riahi H, Tammer C, Zălinescu C. Variational methods in partially ordered spaces. Springer: Berlin; 2003.
   Google Scholar
• Borwein JM. Multivalued convexity and optimization: a unified approach to inequality and equality constraints. Math Program. 1977;13:183–199.
   Web of Science ®Google Scholar
• Seto K, Kuroiwa D, Popovici N. A systematization of convexity and quasiconvexity concepts for set-valued maps, defined by l-type and u-type preorder relations. Optimization. 2018;67:1077–1094.
   Web of Science ®Google Scholar
• Kuroiwa D. Convexity for set-valued maps. Appl Math Lett. 1996;9:97–101.
   Web of Science ®Google Scholar
• Zhang WY, Li SJ, Teo KL. Well-posedness for set optimization problems. Nonlinear Anal TMA. 2009;71:3769–3778.
   Web of Science ®Google Scholar
• Hiriart-Urruty JB. Images of connected sets by semicontinuous multifunctions. J Math Anal Appl. 1985;111:407–422.
   Web of Science ®Google Scholar