Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems
From MaRDI portal
Publication:2416616
Recommendations
- 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
Cites work
- 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?)
- 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 Henig weakly efficient solution set for set-valued optimization problems
- Connectedness of efficient solution sets for set-valued maps in normed spaces
- 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
- 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.
Cited in
(6)- 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
- Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization
- Connectedness of the efficient solution set of a convex vector optimization in normed spaces
- Painlevé-Kuratowski stability of approximate solution sets for perturbed set optimization problems under general ordering sets by recession cone
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)
