Benson proper efficiency in the vector optimization of set-valued maps
From MaRDI portal
Publication:1273914
DOI10.1023/A:1022676013609zbMath0913.90235MaRDI QIDQ1273914
Publication date: 6 January 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
vector optimizationset-valued mapsLagrange multiplierBenson proper efficiencycone subconvexlikenessproper saddle points
Related Items
The analytic hierarchy process and multiobjective 0--1 faculty course assignment ⋮ Stability of the set of solutions for generalized vector equilibrium problems with cone constraints ⋮ Proximal Proper Saddle Points in Set-Valued Optimization ⋮ Conjugate duality and optimization over weakly efficient set ⋮ On the lower semicontinuity of the solution mappings to a parametric generalized strong vector equilibrium problem ⋮ A new kind of inner superefficient points ⋮ Nearly subconvexlike set-valued maps and vector optimization problems ⋮ Optimality conditions for generalized Ky Fan quasi-inequalities with applications ⋮ Strict efficiency in vector optimization with nearly convexlike set-valued maps ⋮ ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ On the generalized Fritz John optimality conditions of vector optimization with set-valued maps under Benson proper efficiency ⋮ Conjugate duality for vector-maximization problems ⋮ Nonconvex vector optimization of set-valued mappings. ⋮ Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization. ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization ⋮ Second-order optimality conditions for cone-subarcwise connected set-valued optimization problems ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ Unnamed Item ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Hartley proper efficiency in multifunction optimization ⋮ Painlevé-Kuratowski convergences of the solution sets for perturbed vector equilibrium problems without monotonicity ⋮ New higher-order weak lower inner epiderivatives and application to Karush-Kuhn-Tucker necessary optimality conditions in set-valued optimization ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ New second-order tangent epiderivatives and applications to set-valued optimization ⋮ Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces ⋮ \( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions ⋮ A note on quasiconvex set-valued maps. ⋮ Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces ⋮ Upper and lower semicontinuity for set-valued mappings involving constraints ⋮ Pareto-Fenchel \({\epsilon}\)-subdifferential sum rule and \({\epsilon}\)-efficiency ⋮ The Lagrange multiplier rule for super efficiency in vector optimization ⋮ Optimality conditions of vector set-valued optimization problem involving relative interior ⋮ A generalized alternative theorem of partial and generalized cone subconvexlike set-valued maps and its applications in linear spaces ⋮ Topological properties of Henig globally efficient solutions of set-valued problems ⋮ The relationship between ic-cone-convexness and nearly cone-subconvexlikeness ⋮ The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces ⋮ Multiobjective programming under generalized type I invexity ⋮ Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ Optimality conditions for strictly efficient solutions in set-valued optimization ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints ⋮ Generalized constraint qualifications and optimality conditions for set-valued optimization problems ⋮ Second-Order M-Composed Tangent Derivative and Its Applications ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ Unnamed Item ⋮ Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions. ⋮ Vector equilibrium problems under improvement sets and linear scalarization with stability applications ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Approximate Benson efficient solutions for set-valued equilibrium problems ⋮ Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions ⋮ E-Benson proper efficiency in vector optimization ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ Characterizations of Hartley proper efficiency in nonconvex vector optimization ⋮ Super efficiency in vector optimization with nearly convexlike set-valued maps.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamental theorems of nondominated solutions associated with cones in normed linear spaces
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Existence and Lagrangian duality for maximization of set-valued functions
- Theorems of the alternative for multifunctions with applications to optimization: General results
- An improved definition of proper efficiency for vector maximization with respect to cones
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Topological structure of efficient set of optimization problem of set- valued mapping
- On the notion of proper efficiency in vector optimization
- Optimization of set-valued functions
- Lagrange multipliers and saddle points in multiobjective programming
- Connectedness of efficient solution sets for set-valued maps in normed spaces
- Quasiconcavity and nondominated solutions in multiobjective programming
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Cone extremal solutions of multi-payoff games with cross-constrained strategy sets
- Theorems of the alternative for set-valued functions in infinite-dimensional spaces
- Invex optimisation problems
- Proper Efficient Points for Maximizations with Respect to Cones
- Optimality conditions for maximizations of set-valued functions
