A cone separation theorem

DOI10.1007/BF00934357zbMath0452.90072MaRDI QIDQ1148815

Mordechai I. Henig

Publication date: 1982

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convex analysismulticriteria optimizationseparation theoremscone analysiscone separationconvex closed acute cones

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items

Approximate efficiency in set-valued optimization with variable order, Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches, An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces, Proper efficiency with respect to cones, Nonlinear Cone Separation Theorems in Real Topological Linear Spaces, About separation by cones, Approximate proper solutions in vector equilibrium problems. Limit behavior and linear scalarization results, Value functions, domination cones and proper efficiency in multicriteria optimization, Separation theorems for nonconvex sets and application in optimization, Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories, Approximation of the efficient point set by perturbation of the ordering cone, Lexicographical separation in \({\mathbb{R}}^ n\), Approximating families of cones and proper efficiency in vector optimization, Limit Behavior of Approximate Proper Solutions in Vector Optimization, On the density of Henig efficient points in locally convex topological vector spaces

Cites Work

• Unnamed Item
• The structure of admissible points with respect to cone dominance
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• State Constraints in Convex Control Problems of Bolza