Cones admitting strictly positive functionals and scalarization of some vector optimization problems
From MaRDI portal
Publication:1379957
DOI10.1023/A:1022654107386zbMath0899.90145OpenAlexW9007564MaRDI QIDQ1379957
Publication date: 5 March 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022654107386
Related Items (8)
Characterizations of some remarkable classes of cones ⋮ Cones with bounded and unbounded bases and reflexivity ⋮ DEMICONTINUITY, GENERALIZED CONVEXITY AND LOOSE SADDLE POINTS OF SET-VALUED MAPS ⋮ On solutions of set-valued optimization problems ⋮ Lagrangian duality in set-valued optimization ⋮ A Survey of Set Optimization Problems with Set Solutions ⋮ Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity ⋮ Full nuclear cones associated to a normal cone. Application to Pareto efficiency.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scalarization of vector optimization problems
- Generalized quasiconvexities, cone saddle points, and minimax theorem for vector-valued functions
- Connectedness of efficient solution sets for set-valued maps in normed spaces
- Scalarizing vector optimization problems
- Convexity for set-valued maps
- Proper efficiency and the theory of vector maximization
- Ordered linear spaces
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Scalarization in vector optimization
- Positive Proper Efficient Points and Related Cone Results in Vector Optimization Theory
- A saddlepoint theorem for set-valued maps
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Separation Properties of Convex Cones
This page was built for publication: Cones admitting strictly positive functionals and scalarization of some vector optimization problems
