Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
From MaRDI portal
Publication:1399607
DOI10.1016/S0377-2217(02)00444-7zbMath1033.90113MaRDI QIDQ1399607
Vicente Novo Sanjurjo, Miguel Adán
Publication date: 30 July 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Levitin-Polyak well-posedness for vector optimization problems in linear spaces ⋮ Duality and saddle-points for convex-like vector optimization problems on real linear spaces ⋮ New vectorial versions of Takahashi's nonconvex minimization problem ⋮ Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ Exact and approximate vector Ekeland variational principles ⋮ Unnamed Item ⋮ Scalar characterizations of weakly cone-convex and weakly cone-quasiconvex functions ⋮ About Hahn-Banach extension theorems and applications to set-valued optimization ⋮ Algebraic interior and separation on linear vector spaces: some comments ⋮ Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ Ekeland variational principles for set-valued functions with set perturbations ⋮ Vectorial Ekeland variational principle for cyclically antimonotone vector equilibrium problems ⋮ Necessary conditions for nondominated solutions in vector optimization ⋮ Ekeland Variational Principles in Vector Equilibrium Problems ⋮ Characterizations of robust optimality conditions via image space analysis ⋮ \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces ⋮ Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces ⋮ Generalized Gerstewitz's functions and vector variational principle for \(\epsilon\)-efficient solutions in the sense of Németh ⋮ Set relations and weak minimal solutions for nonconvex set optimization problems with applications ⋮ Some characterizations of ideal points in vector optimization problems ⋮ Explicitly quasiconvex set-valued optimization ⋮ Optimality conditions for weak efficiency to vector optimization problems with composed convex functions ⋮ Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces ⋮ Approximate solutions of vector optimization problems via improvement sets in real linear spaces ⋮ Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces ⋮ Unifying local-global type properties in vector optimization ⋮ Proper efficiency in vector optimization on real linear spaces. ⋮ The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces ⋮ Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem ⋮ Nonlinear separation approach to inverse variational inequalities in real linear spaces ⋮ On relatively solid convex cones in real linear spaces ⋮ Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ Vectorial form of Ekeland variational principle with applications to vector equilibrium problems ⋮ On the Intrinsic Core of Convex Cones in Real Linear Spaces ⋮ Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequality systems and optimization
- Alternative theorems and optimality conditions with weakened convexity
- Foundations of optimization
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- Lagrange multipliers and saddle points in multiobjective programming
- Efficient and weak efficient points in vector optimization with generalized cone convexity
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- A generalization of a theorem of Fan
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convexlike alternative theorems and mathematical programming
