Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems
This paper deals with sufficient conditions for the connectedness of the set of approximate efficient solutions for the generalized semi-infinite vector optimization problem with set-valued objective mappings (GSIVOP for short). After giving some preliminaries, a class of GSIVOP's is introduced in Section 2.1. Then some definitions related to generalized convexity are summarized in Section 2.2. Some basic facts on upper semi-continuous and lower semi-continuous mappings are presented in Section 2.3. Section 3 establishes sufficient conditions under which the constraint set mapping for the problem GSIVOP is convex valued and upper semi-continuous. Section 4 deals with the connectedness of approximate efficient solutions of the problem GSIVOP. First, in Section 4.1, a scalarized semi-infinite programming problem is introduced and some properties of this problem are presented. Section 4.2 gives sufficient conditions for the connectedness of the set of approximate efficient points (Theorem 4.6) and the set of approximate efficient solutions (Theorem 4.7) of the problem GSIVOP. The results of this paper generalize the results from \textit{X. H. Gong} [J. Optim. Theory Appl. 83, No. 1, 83--96 (1994; Zbl 0845.90104)] and \textit{Z.-F. Li} and \textit{S.-Y. Wang} [Math. Methods Oper. Res. 48, No. 2, 207--217 (1998; Zbl 0928.90081)].
- Connectedness of the efficient solution set of a convex vector optimization in normed spaces
- Connectedness of approximate Henig efficient solution sets for set-valued optimization problems with constraints
- scientific article; zbMATH DE number 7403904
- Connectedness of the approximate solution sets for set optimization problems
- Connectedness of approximate Henig efficient solution set for set-valued optimization problems
- An existence result for the generalized vector equilibrium problem
- Calmness modulus of linear semi-infinite programs
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Connectedness and path-connectedness of solution sets to symmetric vector equilibrium problems
- Connectedness of efficient solution sets for set-valued maps in normed spaces
- Connectedness of Henig weakly efficient solution set for set-valued optimization problems
- Connectedness of super efficient sets in vector optimization of set-valued maps
- Connectedness of the set of efficient solutions for generalized systems
- Convex analysis and nonlinear optimization. Theory and examples.
- Existence and continuity of solutions for vector optimization
- Existence and stability of solutions for generalized ky Fan inequality problems with trifunctions
- Existence theorems for saddle points of vector-valued maps
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 4044567 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 798063 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- Images of connected sets by semicontinuous multifunctions
- Nonsmooth semi-infinite programming problem using limiting subdifferentials
- On the connectedness of efficient solutions for generalized Ky Fan inequality
- On the connectedness of the solution set for the weak vector variational inequality
- Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
- Semi-infinite optimization under convex function perturbations: Lipschitz stability
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Some properties of approximate solutions for vector optimization problem with set-valued functions
- Stability of semi-infinite vector optimization problems under functional perturbations
- Stability of semi-infinite vector optimization problems without compact constraints
- Super Efficiency in Vector Optimization
- Vector optimization. Set-valued and variational analysis.
- Connectedness of the efficient solution set of a convex vector optimization in normed spaces
- Connectedness of the approximate solution sets for set optimization problems
- Connectedness of the solution sets in generalized semi-infinite set optimization
- Hadamard well-posedness for a set optimization problem with an infinite number of constraints
- Painlevé-Kuratowski stability of approximate solution sets for perturbed set optimization problems under general ordering sets by recession cone
- Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization
- Well-posedness for set optimization problems involving set less relation via scalarization method
- Scalarization and well-posedness for set optimization problems involving general set less relations
- Existence and arcwise connectedness of robust solutions for uncertain generalized multi-objective optimization problems
- Hausdorff continuity of solution maps to equilibrium problems via the oriented distance function
- Some results of Karush-Kuhn-Tucker multipliers in robust semi-infinite multiobjective optimization
- New applications of linear semi-infinite optimization theory in copositive optimization
This page was built for publication: Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2416616)
