Cone characterizations of approximate solutions in real vector optimization
This paper studies approximate solutions of a real-vector optimization problem and proposes a formal framework of cones for their characterization. In particular, first some preliminaries are provided by defining (weakly) minimal and epsilon-minimal elements as the adopted concepts of approximate solutions and formalizing the notion of translated cones (i.e., a cone that is translated from the origin). Next, alternative representations of translated cones are presented, where the major focus is on a possible description by systems of linear inequalities. Then these representations are used to characterize epsilon-minimal elements with respect to polyhedral cones as minimal solutions with respect to translated polyhedral cones. Finally, the problem of optimizing over the set of minimal or epsilon-minimal elements is considered, i.e., the problem of identifying maximal elements among the set of epsilon-minimal elements.
- Approximately Efficient Solutions in Vector Optimization
- On Approximate Solutions in Convex Vector Optimization
- scientific article; zbMATH DE number 5066294
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- On approximate solutions in vector optimization problems via scalarization
- Approximately Efficient Solutions in Vector Optimization
- Approximation methods in multiobjective programming
- Comparison of existence results for efficient points
- Complete efficiency and interdependencies between objective functions in vector optimization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Convex Analysis
- Duality for Bregman projections onto translated cones and affine subspaces.
- Epsilon approximate solutions for multiobjective programming problems
- Epsilon efficiency
- Exact generation of epsilon-efficient solutions in multiple objective programming
- Existence of \(\varepsilon\)-minima for vector optimization problems
- Generalization of domination structures and nondominated solutions in multicriteria decision making
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- scientific article; zbMATH DE number 3932805 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 1080418 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- On approximate efficiency in multiobjective programming
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- On Approximate Solutions in Convex Vector Optimization
- On approximate solutions in vector optimization problems via scalarization
- On several concepts for \(\varepsilon\)-efficiency
- Optimization over the efficient set: Four special cases
- Optimization over the efficient set: overview
- Order-preserving transformations and applications
- Theory of multiobjective optimization
- ε-approximate solutions in multiobjective optimization
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
- Tradeoff-based decomposition and decision-making in multiobjective programming
- Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Vector optimization w.r.t. relatively solid convex cones in real linear spaces
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- Approximate solutions of multiobjective optimization problems
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Characterizing -properly efficient solutions
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Détermination explicite du cône contingent; application à l'optimisation
- An -minimax theorem for bi-lower-semicontinuous set-valued mappings
- A survey of conical approximations used in the optimization
- Approximating families of cones and proper efficiency in vector optimization
- On the effects of combining objectives in multi-objective optimization
- On AKKT optimality conditions for cone-constrained vector optimization problems
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- Lagrange multiplier rules for weak approximate Pareto solutions to constrained vector optimization problems with variable ordering structures
- Covers and approximations in multiobjective optimization
- Approximately Efficient Solutions in Vector Optimization
- Approximate proper efficiency for multiobjective optimization problems
- Characterizing properties of approximate solutions for optimization problems
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Approximating biobjective minimization problems using general ordering cones
- On approximate optimality conditions for robust multi-objective convex optimization problems
- Multicriteria optimization with a multiobjective golden section line search
- Two techniques to reduce the Pareto optimal solutions in multiobjective optimization problems
- A branch and bound algorithm for continuous multiobjective optimization problems using general ordering cones
This page was built for publication: Cone characterizations of approximate solutions in real vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471114)
