Proper Efficient Points for Maximizations with Respect to Cones

Cited in

(only showing first 100 items - show all)

Improved -constraint method for multiobjective programming
Solutions of fuzzy multiobjective programming problems based on the concept of scalarization
Efficiency and proper efficiency in vector maximization with respect to cones
Existence theorems in vector optimization
On efficient sets in vector maximum problems - A brief survey
A survey of vector optimization in infinite-dimensional spaces. II
Necessary conditions of nondominated solutions in multicriteria decision making
Sensitivity analysis in multiobjective optimization
Weighting factor results in vector optimization
Characterizing the nondominated set by separable functions
The domination property in multicriteria optimization
Some hybrid fixed point theorems related to optimization
Families of differentiable scalarization functions
Strong duality for infinite-dimensional vector-valued programming problems
An improved definition of proper efficiency for vector maximization with respect to cones
Duality for nonlinear multiple-criteria optimization problems
Lexocographic multipliers
Proper efficiency with respect to cones
On proper and improper efficient solutions of optimal problems with multicriteria
Admissible points of a convex polyhedron
Duality theory for maximizations with respect to cones
Properly efficient and efficient solutions for vector maximization problems in Euclidean space
On a domination property for vector maximization with respect to cones
Optimality conditions in nonconical multiple objective programming
Characterization of properly efficient solutions by generalized scalarization methods
Lagrange multiplier theorem of multiobjective programming problems with set functions
Proper efficiency in nonconvex vector-maximization-problems
The structure of admissible points with respect to cone dominance
Characterizations of the Benson proper efficiency for nonconvex vector optimization
Benson proper efficiency in the vector optimization of set-valued maps
Super efficient solutions and super infima in vector optimization
Duality theory for infinite-dimensional multiobjective linear programming
Bases of convex cones and Borwein's proper efficiency
Proper solutions of vector optimization problems
Major-efficient solutions and weakly major-efficient solutions of multiobjective programming
On the notion of proper efficiency in vector optimization
Density theorems for generalized Henig proper efficiency
Tradeoff directions in multiobjective optimization problems
Proper efficiency in locally convex topological vector spaces
The domination property for efficiency in locally convex spaces
Lagrangian duality for minimization of nonconvex multifunctions
On the properly efficient points of nonconvex sets
Generalized minimax inequalities for set-valued mappings
On the generalized Fritz John optimality conditions of vector optimization with set-valued maps under Benson proper efficiency
Nonconvex vector optimization of set-valued mappings.
Hartley proper efficiency in multifunction optimization
Near-subconvexlikeness in vector optimization with set-valued functions
Characterizations via linear scalarization of minimal and properly minimal elements
A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
Coradiant-valued maps and approximate solutions in variable ordering structures
Multicriteria fractional programming -- an approach by means of conjugate functions
Properly efficient solutions for vectorial norm approximation
A minimax inequality for vector-valued mappings
Concepts of proper efficiency
Super efficiency in vector optimization with nearly convexlike set-valued maps.
On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
On the transformation of lexicographic nonlinear multiobjective programs to single objective programs
Necessary conditions for efficient solution of vector optimization problems
Higher-order cone-pseudoconvex, quasiconvex and other related functions in vector optimization
Superefficiency in vector optimization with nearly subconvexlike set-valued maps
Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
Characterizations of efficient and weakly efficient points in nonconvex vector optimization
Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets
Approximate proper solutions in vector equilibrium problems. Limit behavior and linear scalarization results
Trade-off ratio functions for linear and piecewise linear multi-objective optimization problems
Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories
New notions of proper efficiency in set optimization with the set criterion
Improperly efficient solutions in a class of vector optimization problems
Vector optimization w.r.t. relatively solid convex cones in real linear spaces
On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
Existence of efficient and properly efficient solutions to problems of constrained vector optimization
Necessary conditions for super minimizers in constrained multiobjective optimization
Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria
A conic scalarization method in multi-objective optimization
An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces
Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization
Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
Bilevel optimization with a multiobjective problem in the lower level
Superefficiency in local convex spaces
Stability results for efficient solutions of vector optimization problems
Hartley proper efficiency in multiobjective optimization problems with locally Lipschitz set-valued objectives and constraints
Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps
Characterizations of Hartley proper efficiency in nonconvex vector optimization
Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
A note on approximate proper efficiency in linear fractional vector optimization
Approximate properly solutions of constrained vector optimization with variable coradiant sets
ε–Optimality to approximation in partially ordered spaces
Characterization of properly optimal elements with variable ordering structures
On efficient solutions with trade-offs bounded by given values
Set Optimization—A Rather Short Introduction
Approximate proper efficiency in vector optimization
A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case
Vector equilibrium problems under improvement sets and linear scalarization with stability applications
Strongly proper efficient solutions: efficient solutions with bounded trade-offs
Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
Existence results for strong vector equilibrium problems and their applications
Proximal proper saddle points in set-valued optimization
Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization
A combined scalarizing method for multiobjective programming problems

This page was built for publication: Proper Efficient Points for Maximizations with Respect to Cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146574)