Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
From MaRDI portal
Publication:1937018
DOI10.1007/s10957-012-0045-2zbMath1267.90136OpenAlexW2023949084MaRDI QIDQ1937018
Publication date: 11 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0045-2
Related Items (11)
Levitin-Polyak well-posedness for vector optimization problems in linear spaces ⋮ Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors ⋮ \(E\)-super efficiency of set-valued optimization problems involving improvement sets ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces ⋮ Approximate solutions of vector optimization problems via improvement sets in real linear spaces ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Approximate proper efficiency in vector optimization ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ Approximate Benson efficient solutions for set-valued equilibrium problems ⋮ Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
Cites Work
- Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions
- Proper efficiency in vector optimization on real linear spaces.
- Benson proper efficiency in the vector optimization of set-valued maps
- A theorem of the alternative and its application to the optimization of set-valued maps
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- The optimality conditions for vector optimization of set-valued maps
- On the notion of proper efficiency in vector optimization
- Lagrange multipliers and saddle points in multiobjective programming
- Lagrangian duality for minimization of nonconvex multifunctions
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- Near-subconvexlikeness in vector optimization with set-valued functions
- New generalized convexity notion for set-valued maps and application to vector optimization
- Theorems of the alternative and optimization with set-valued maps
- Globally proper saddle point in ic-cone-convexlike set-valued optimization problems
- Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces
- Vector Optimization
- Scalarization in vector optimization
- e-weak minimal solutions of vector optimization problems with set-valued maps
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
