An improved definition of proper efficiency for vector maximization with respect to cones
From MaRDI portal
(Redirected from Publication:1131964)
Cites work
- scientific article; zbMATH DE number 3416582 (Why is no real title available?)
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convergence of Sequences of Convex Sets, Cones and Functions. II
- Convergence of sequences of convex sets, cones and functions
- Efficiency and proper efficiency in vector maximization with respect to cones
- Efficiency in multiple objective optimization problems
- Existence of efficient solutions for vector maximization problems
- Hypercomplete linear topological spaces
- Nonlinear Programming in Banach Space
- Proper Efficient Points for Maximizations with Respect to Cones
- Proper efficiency and the theory of vector maximization
Cited in
(only showing first 100 items - show all)- Second-order strong Karush/Kuhn-Tucker conditions for proper efficiencies in multiobjective optimization
- On the characterization of efficient points by means of monotone functionals
- Karush-Kuhn-Tucker multiplier rules for efficient solutions of set-valued equilibrium problem with constraints
- Higher-order duality in vector optimization over cones
- Lagrangian duality for minimization of nonconvex multifunctions
- An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces
- Local completeness and Pareto optimization
- A conic scalarization method in multi-objective optimization
- A notion of local proper efficiency in the Borwein sense in vector optimisation
- Characterizing the nondominated set by separable functions
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Coradiant-valued maps and approximate solutions in variable ordering structures
- A note on connectivity of efficient solution sets
- Conic scalarization method in multiobjective optimization and relations with other scalarization methods
- Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces
- Proximal proper efficiency for minimisation with respect to normal cones
- New notions of proper efficiency in set optimization with the set criterion
- On efficient sets in vector maximum problems - A brief survey
- Families of differentiable scalarization functions
- -strict subdifferentials of set-valued maps and optimality conditions
- Approximate duality for vector quasi-equilibrium problems and applications
- Improperly efficient solutions in a class of vector optimization problems
- Connectedness of the solution sets and scalarization for vector equilibrium problems
- Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs
- \(E\)-super efficiency of set-valued optimization problems involving improvement sets
- Strongly proper efficient solutions: efficient solutions with bounded trade-offs
- Proximal proper saddle points in set-valued optimization
- Well-posedness and stability in vector optimization problems using Henig proper efficiency
- Major-efficient solutions and weakly major-efficient solutions of multiobjective programming
- Geoffrion type characterization of higher-order properly efficient points in vector optimization
- Higher-order sensitivity analysis in set-valued optimization under Henig efficiency
- A minimax inequality for vector-valued mappings
- The domination property for efficiency in locally convex spaces
- Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
- Density theorems for generalized Henig proper efficiency
- Super efficient solutions and super infima in vector optimization
- Bilevel optimization with a multiobjective problem in the lower level
- Global proper efficiency and vector optimization with cone-arcwise connected set-valued maps
- Proper efficiency in nonconvex vector-maximization-problems
- Unified representation of proper efficiency by means of dilating cones
- Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
- Stability of optimal points with respect to improvement sets
- Super efficiency of multicriterion network equilibrium model and vector variational inequality
- Proper solutions of vector optimization problems
- Higher-order cone-pseudoconvex, quasiconvex and other related functions in vector optimization
- Proper efficiency in locally convex topological vector spaces
- Multiobjective Programming and Multiattribute Utility Functions in Portfolio Optimization
- Radial epiderivatives and set-valued optimization
- Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- On the notion of proper efficiency in vector optimization
- A combined scalarizing method for multiobjective programming problems
- Proper minimal points of nonconvex sets in Banach spaces in terms of the limiting normal cone
- Anchor points in multiobjective optimization: definition, characterization and detection
- Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
- Value functions, domination cones and proper efficiency in multicriteria optimization
- Existence and density results for proper efficiency in cone compact sets
- Quasi-proper efficiency: a quantitative enhanced efficiency
- Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches
- Limit behavior of approximate proper solutions in vector optimization
- On a practical notion of geoffrion proper optimality in multicriteria optimization
- On approximating weakly/properly efficient solutions in multi-objective programming
- Geoffrion's proper efficiency in linear fractional vector optimization with unbounded constraint sets
- Ekeland variational principles involving set perturbations in vector equilibrium problems
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Generalized polarity and weakest constraint qualifications in multiobjective optimization
- Duality in nonconvex vector optimization
- Sensitivity analysis in convex vector optimization
- Density and connectedness of optimal points with respect to improvement sets
- Approximating families of cones and proper efficiency in vector optimization
- Proper efficiency with respect to cones
- Optimization over the efficient set
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- \(E\)-Benson proper efficiency in vector optimization
- Efficiency and proper efficiency in vector maximization with respect to cones
- Robustness in nonsmooth nonlinear multi-objective programming
- A new characterization of cone proper efficient points
- Solutions of fuzzy multiobjective programming problems based on the concept of scalarization
- Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
- Properly efficient and efficient solutions for vector maximization problems in Euclidean space
- Characterization of properly efficient solutions by generalized scalarization methods
- Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems
- Topological properties of Henig globally efficient solutions of set-valued problems
- Improved -constraint method for multiobjective programming
- Existence and characterization of efficient decisions with respect to cones
- Variable preference modeling with ideal-symmetric convex cones
- A combined scalarization method for multi-objective optimization problems
- Admissible points of a convex polyhedron
- Characterizations of efficient and weakly efficient points in nonconvex vector optimization
- A review of multiobjective programming and its application in quantitative psychology
- The Role of Cardinal Utilities in Multiple Objective Programming
- Weak Henig proper solution sets for set optimization problems
- On efficient solutions with trade-offs bounded by given values
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
- Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions
- Quadratic scalarization for decomposed multiobjective optimization
- A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
- Necessary conditions for super minimizers in constrained multiobjective optimization
This page was built for publication: An improved definition of proper efficiency for vector maximization with respect to cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1131964)