Connectedness of super efficient sets in vector optimization of set-valued maps
From MaRDI portal
Recommendations
- Connectedness of \(\varepsilon\)-super efficient solution set of vector optimization of set-valued maps
- scientific article; zbMATH DE number 1779481
- Connectedness of super efficient solution set for set-valued optimization problems with constraints
- Connectedness of super-efficient point sets for vector optimization of nearly convex-like set-valued maps
- Connectivity of efficient solution sets in vector optimization of set-valued mappings
- scientific article; zbMATH DE number 934842
- Super efficiency in vector optimization of set-valued maps
- Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems
- scientific article; zbMATH DE number 1286418
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
Cited in
(22)- Strict efficiency of a multi-product supply-demand network equilibrium model
- scientific article; zbMATH DE number 1779481 (Why is no real title available?)
- Connectedness of Henig weakly efficient solution set for set-valued optimization problems
- Connectedness of cone superefficient point sets in locally convex topological vector spaces
- Higher-order sensitivity analysis in set-valued optimization under Henig efficiency
- Topological structure of efficient set of optimization problem of set- valued mapping
- scientific article; zbMATH DE number 2032441 (Why is no real title available?)
- scientific article; zbMATH DE number 1779405 (Why is no real title available?)
- Connectedness of the approximate solution sets for set optimization problems
- Arcwise connectedness of the solution sets for set optimization problems
- On the contractibility and connectedness of an efficient point set.
- Topological properties of Henig globally efficient solutions of set-valued problems
- Contractibility of the solution sets for set optimization problems
- Connectedness of super-efficient point sets for vector optimization of nearly convex-like set-valued maps
- Connectedness of \(\varepsilon\)-super efficient solution set of vector optimization of set-valued maps
- Sensitivity analysis in set-valued optimization under strictly minimal efficiency
- Connectedness of weak minimal solution set for set optimization problems
- Connectedness of super efficient solution set for set-valued optimization problems with constraints
- Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems
- Hadamard well-posedness for a set optimization problem with an infinite number of constraints
- Connectedness of approximate efficient solutions for generalized semi-infinite vector optimization problems
- Strong duality with super efficiency in set-valued optimization
This page was built for publication: Connectedness of super efficient sets in vector optimization of set-valued maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1298717)
