Coradiant sets and -efficiency in multiobjective optimization
From MaRDI portal
Publication:2399486
The main purpose of this paper is to study approximate efficient solutions of a multiobjective optimization problem with respect to a coradiant set. The authors introduce the concept of Bishop-Phelps coradiant sets, establish properties of these sets and the \(\epsilon\)-dual and the augmented \(\epsilon\)-dual sets associated with a coradiant set. Then they use them to construct scalarizing functions to characterize \(\epsilon\)-efficient and proper \(\epsilon\)-efficient elements of a given set.
Recommendations
Cites work
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- -duality theorem of nondifferentiable nonconvex multiobjective programming
- -optimality for bicriteria programs and its application to minimum cost flows
- \(\epsilon\)-solutions in vector minimization problems
- A conic scalarization method in multi-objective optimization
- A generalization of ekellandz’s variational principle
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Adaptive Scalarization Methods in Multiobjective Optimization
- Approximate saddle-point theorems in vector optimization
- Approximation of solutions for location problems
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- Epsilon efficiency
- scientific article; zbMATH DE number 3643053 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 912668 (Why is no real title available?)
- scientific article; zbMATH DE number 3240641 (Why is no real title available?)
- Multicriteria optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- Nonlinear multiobjective optimization
- On approximate efficiency in multiobjective programming
- On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
- Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
- The nonlinear separation theorem and a representation theorem for Bishop-Phelps cones
Cited in
(11)- Quasi-Newton methods for multiobjective optimization problems
- Coradiant-valued maps and approximate solutions in variable ordering structures
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- Duality in nonconvex vector optimization
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- Approximate properly solutions of constrained vector optimization with variable coradiant sets
- Relationships between efficient set and -efficient set
- The equivalent representation of co-radiant sets and its application in multi-objective optimization problems
- Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization
- Linear and nonlinear scalarization methods for vector optimization problems with variable ordering structures
- A unified framework for approximate solutions in vector optimization: introducing quasi-non-dominated and quasi-minimal concepts
This page was built for publication: Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399486)
