Proper efficiency with respect to cones
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3078986 (Why is no real title available?)
- A cone separation theorem
- An improved definition of proper efficiency for vector maximization with respect to cones
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convex Analysis
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Proper Efficient Points for Maximizations with Respect to Cones
- Proper efficiency and the theory of vector maximization
- The Vector Maximization Problem: Proper Efficiency and Stability
- The structure of admissible points with respect to cone dominance
Cited in
(only showing first 100 items - show all)- Globally proper efficiency of set-valued optimization and vector variational inequality involving the generalized contingent epiderivative
- Multiplicative decision rules for multiobjective decision problems
- Some more density results for proper efficiencies
- Conical regularization for multi-objective optimization problems
- On the characterization of efficient points by means of monotone functionals
- Generalized connected functions with respect to cones
- Karush-Kuhn-Tucker multiplier rules for efficient solutions of set-valued equilibrium problem with constraints
- An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces
- A conic scalarization method in multi-objective optimization
- On the existence of efficient points
- A notion of local proper efficiency in the Borwein sense in vector optimisation
- Characterizing the nondominated set by separable functions
- Nonlinear strict cone separation theorems in real normed spaces
- Robustness in deterministic vector optimization
- Coradiant-valued maps and approximate solutions in variable ordering structures
- 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
- Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
- On compromise solutions in multiple objective programming
- New notions of proper efficiency in set optimization with the set criterion
- Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
- Nonconvex separation theorems and some applications in vector optimization
- Families of differentiable scalarization functions
- Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories
- Multiple-objective programming with polynomial objectives and constraints
- -strict subdifferentials of set-valued maps and optimality conditions
- Globally proper saddle point in ic-cone-convexlike set-valued optimization problems
- Connectedness of the solution sets and scalarization for vector equilibrium problems
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization
- Henig proper subdifferential of set-valued maps
- Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef:
- Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs
- On proper minimality in set optimization
- Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative
- \(E\)-super efficiency of set-valued optimization problems involving improvement sets
- The Ekeland variational principle for Henig proper minimizers and super minimizers
- Strongly proper efficient solutions: efficient solutions with bounded trade-offs
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Well-posedness and stability in vector optimization problems using Henig proper efficiency
- Major-efficient solutions and weakly major-efficient solutions of multiobjective programming
- Optimality conditions for \(C^{1,1}\) vector optimization problems
- Geoffrion type characterization of higher-order properly efficient points in vector optimization
- Higher-order variational sets and higher-order optimality conditions for proper efficiency in set-valued nonsmooth vector optimization
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- Lagrange multiplier theorem of multiobjective programming problems with set functions
- Sensitivity and stability for the second-order contingent derivative of the proper perturbation map in vector optimization
- Higher-order sensitivity analysis in set-valued optimization under Henig efficiency
- Existence and characterization theorems in nonconvex vector optimization
- The domination property for efficiency in locally convex spaces
- A unified approach to uncertain optimization
- Density theorems for generalized Henig proper efficiency
- Super efficient solutions and super infima in vector optimization
- Global proper efficiency and vector optimization with cone-arcwise connected set-valued maps
- Unified representation of proper efficiency by means of dilating cones
- Further results on quasi efficient solutions in multiobjective optimization
- 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
- Proper efficiency in locally convex topological vector spaces
- A note on lower semicontinuity of minimal points
- Higher-order optimality conditions in set-valued optimization using Studniarski derivatives and applications to duality
- 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
- Proper efficiency conditions and duality results for nonsmooth vector optimization in Banach spaces under (, )-invexity
- 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
- First-order optimality conditions in set-valued optimization
- Bases of convex cones and Borwein's proper efficiency
- 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
- On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization
- Order-preserving transformations and applications
- 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
- Optimization over the efficient set
- A generalization of a theorem of Arrow, Barankin and Blackwell to a nonconvex case
- On redundancy in multi criteria decision making
- A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- \(E\)-Benson proper efficiency in vector optimization
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
- Robustness in nonsmooth nonlinear multi-objective programming
- A new characterization of cone proper efficient points
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
This page was built for publication: Proper efficiency with respect to cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148816)
