Connectedness of super efficient solution set for set-valued optimization problems with constraints
From MaRDI portal
Publication:5282605
zbMATH Open1374.49022MaRDI QIDQ5282605FDOQ5282605
Authors: Min Cao, Yang Wang, Jian-Chen Chen
Publication date: 14 July 2017
Recommendations
- scientific article; zbMATH DE number 1779481
- scientific article; zbMATH DE number 2032441
- Connectedness of \(\varepsilon\)-super efficient solution set of vector optimization of set-valued maps
- Connectedness of super efficient sets in vector optimization of set-valued maps
- scientific article; zbMATH DE number 1779405
Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53)
Cited In (8)
- Title not available (Why is that?)
- Connectedness of Henig weakly efficient solution set for set-valued optimization problems
- Title not available (Why is that?)
- Connectedness of the solution sets in generalized semi-infinite set optimization
- Connectedness of super efficient sets in vector optimization of set-valued maps
- 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
- The connectedness of the globally minimal solution set for set-valued optimization problems
This page was built for publication: Connectedness of super efficient solution set for set-valued optimization problems with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282605)