On the notion of proper efficiency in vector optimization
From MaRDI portal
Publication:1335113
DOI10.1007/BF02191776zbMath0827.90123MaRDI QIDQ1335113
Elena Molho, Alberto Zaffaroni, Angelo Guerraggio
Publication date: 27 September 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
A note on lower semicontinuity of minimal points ⋮ Stability of minimizers of set optimization problems ⋮ Proper minimal points of nonconvex sets in Banach spaces in terms of the limiting normal cone ⋮ Nonsmooth vector-valued invex functions and applications ⋮ Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems ⋮ Vector optimization w.r.t. relatively solid convex cones in real linear spaces ⋮ Proper efficiency and vector variational inequalities ⋮ Proximal Proper Saddle Points in Set-Valued Optimization ⋮ Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches ⋮ Proper efficiency in locally convex topological vector spaces ⋮ Geoffrion type characterization of higher-order properly efficient points in vector optimization ⋮ Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone ⋮ Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ A decomposition approach to vector equilibrium problems ⋮ Higher-order Karush–Kuhn–Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ Generalizations of a theorem of Arrow, Barankin, and Blackwell in topological vector spaces ⋮ On necessary optimality conditions with higher-order complementarity slackness for set-valued optimization problems ⋮ Generalized polarity and weakest constraint qualifications in multiobjective optimization ⋮ First and second-order optimality conditions without differentiability in multivalued vector optimization ⋮ Henig proper generalized vector quasiequilibrium problems ⋮ Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces ⋮ On approximating weakly/properly efficient solutions in multi-objective programming ⋮ Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ On proper minimality in set optimization ⋮ First and second-order optimality conditions using approximations for vector equilibrium problems with constraints ⋮ Connectivity of efficient solution sets in vector optimization of set-valued mappings ⋮ On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization ⋮ Optimality conditions for \(C^{1,1}\) constrained multiobjective problems ⋮ Higher-order radial derivatives and optimality conditions in nonsmooth vector optimization ⋮ Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization ⋮ Duality results for generalized vector variational inequalities with set-valued maps ⋮ Order-preserving transformations and applications ⋮ Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef: ⋮ Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems ⋮ Isolated and proper efficiencies in semi-infinite vector optimization problems ⋮ On higher-order sensitivity analysis in nonsmooth vector optimization ⋮ Hartley proper efficiency in multifunction optimization ⋮ A new representation of efficient point sets and its applications in DEA ⋮ Strong duality with super efficiency in set-valued optimization ⋮ Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems ⋮ Quasi-proper efficiency: a quantitative enhanced efficiency ⋮ Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ Stability results for efficient solutions of vector optimization problems ⋮ An equivalent transformation of multi-objective optimization problems ⋮ Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization ⋮ Higher-order optimality conditions for proper efficiency in nonsmooth vector optimization using radial sets and radial derivatives ⋮ Approximate duality for vector quasi-equilibrium problems and applications ⋮ Stability of properly efficient points and isolated minimizers of constrained vector optimization problems ⋮ Optimality conditions for \(C^{1,1}\) vector optimization problems ⋮ Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets ⋮ Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure ⋮ Characterization of properly optimal elements with variable ordering structures ⋮ Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints ⋮ Existence and density results for proper efficiency in cone compact sets ⋮ Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints ⋮ Approximate proper efficiency in vector optimization ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces ⋮ $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ Critical points index for vector functions and vector optimization ⋮ Strong Duality with Proper Efficiency in Multiobjective Optimization Involving Nonconvex Set-Valued Maps ⋮ Characterizations of the Benson proper efficiency for nonconvex vector optimization ⋮ Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization ⋮ Benson proper efficiency in the vector optimization of set-valued maps ⋮ A notion of local proper efficiency in the Borwein sense in vector optimisation ⋮ Computation formulas and multiplier rules for graphical derivatives in separable Banach spaces ⋮ Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions ⋮ Proper efficiency and duality for a class of constrained multiobjective fractional optimal control problems containing arbitrary norms ⋮ Scalarization of Henig proper efficient points in a normed space ⋮ Unified representation of proper efficiency by means of dilating cones ⋮ Characterization of solutions of multiobjective optimization problem ⋮ Characterizations of Hartley proper efficiency in nonconvex vector optimization ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification ⋮ Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria ⋮ Scalarization and stability in vector optimization ⋮ The extension theorems of cone linear operators
Cites Work
- Unnamed Item
- Unnamed Item
- A survey of vector optimization in infinite-dimensional spaces. II
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Optimality conditions in nonconical multiple objective programming
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Proper efficiency and the theory of vector maximization
- Positive Proper Efficient Points and Related Cone Results in Vector Optimization Theory
- A Characterization of Properly Minimal Elements of a Set
- The geometry of Pareto efficiency over cones
- Proper Efficient Points for Maximizations with Respect to Cones
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Super Efficiency in Vector Optimization
- On the notion of tangent cone in mathematical programming
- Letter to the Editor—Improper Solutions of the Vector Maximum Problem
