Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
From MaRDI portal
Publication:1384055
DOI10.1023/A:1022615217553zbMath0897.90163OpenAlexW1491306394MaRDI QIDQ1384055
Publication date: 13 April 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:1022615217553
Related Items (26)
Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization ⋮ Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization ⋮ On efficient solutions in vector optimization ⋮ A new approach to characterize the solution set of a pseudoconvex programming problem ⋮ On the existence of weak efficient solutions of nonconvex vector optimization problems ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ Existence of solutions for vector optimization on Hadamard manifolds ⋮ Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems ⋮ Existence and boundedness of solutions in infinite-dimensional vector optimization problems ⋮ Characterizing the nonemptiness and compactness of the solution set of a vector variational inequality by scalarization ⋮ A quasiconvex asymptotic function with applications in optimization ⋮ Existence of efficient and properly efficient solutions to problems of constrained vector optimization ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ Characterizations of solution sets of cone-constrained convex programming problems ⋮ Characterizations of solution sets for parametric multiobjective optimization problems ⋮ On the set of weakly efficient minimizers for convex multiobjective programming ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications ⋮ Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives ⋮ Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces ⋮ Coercivity properties and well-posedness in vector optimization ⋮ Optimality conditions for vector optimization problems ⋮ Existence of Pareto solutions for vector polynomial optimization problems with constraints ⋮ Recession function and its applications in optimization
Cites Work
- Theory of multiobjective optimization
- The structure of admissible points with respect to cone dominance
- Existence and continuity of solutions for vector optimization
- A characterization of weakly efficient points
- Existence and characterization of efficient decisions with respect to cones
- Variational Analysis
- On Approximate Solutions in Convex Vector Optimization
- On the Existence of Pareto Efficient Points
- Convex Analysis
This page was built for publication: Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
