Efficiency and proper efficiency in vector maximization with respect to cones

DOI10.1016/0022-247X(83)90230-5zbMath0519.90080MaRDI QIDQ1055343

Harold P. Benson

Publication date: 1983

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

efficiency conditionsexistence conditionsvector maximizationdomination coneefficient and properly efficient solutionsnoncomparable criterion functions

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items

Second-order conditions for efficiency in nonsmooth multiobjective optimization problems, Duality and saddle-points for convex-like vector optimization problems on real linear spaces, Optimizing a linear function over an efficient set, Vector optimization w.r.t. relatively solid convex cones in real linear spaces, A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions, An improved definition of proper efficiency for vector maximization with respect to cones, On the properly efficient points of nonconvex sets, On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization, On a domination property for vector maximization with respect to cones, Optimality conditions in nonconical multiple objective programming, Lagrange multiplier theorem of multiobjective programming problems with set functions, Complete efficiency and the initialization of algorithms for multiple objective programming, Optimization over the efficient set, Variable preference modeling with ideal-symmetric convex cones, Proper efficiency in vector optimization on real linear spaces., Parametrized multicriteria optimization: Continuity and closedness of optimal multifunctions, An exact penalty on bilevel programs with linear vector optimization lower level, Solutions of fuzzy multiobjective programming problems based on the concept of scalarization, The vector complementary problem and its equivalences with the weak minimal element in ordered spaces, Second-order efficiency conditions and sensitivity of efficient points, Optimization of a linear function on the set of efficient solutions of a multicriterion convex quadratic problem, Bases of convex cones and Borwein's proper efficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved definition of proper efficiency for vector maximization with respect to cones
• Linear multiobjective programming
• Existence of efficient solutions for vector maximization problems
• Duality and stability in extremum problems involving convex functions
• Proper efficiency and the theory of vector maximization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• The Vector Maximization Problem: Proper Efficiency and Stability
• Efficiency in multiple objective optimization problems
• Proper Efficient Points for Maximizations with Respect to Cones
• Finding all efficient extreme points for multiple objective linear programs
• Nonlinear Programming in Banach Space
• A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
• Symmetric Duality for Generalized Unconstrained Geometric Programming
• Convergence of sequences of convex sets, cones and functions