Coradiant sets and -efficiency in multiobjective optimization

DOI10.1007/S10898-016-0495-4zbMATH Open1392.90101OpenAlexW2567934863MaRDI QIDQ2399486FDOQ2399486

Authors Abbas Sayadi-bander, L. Pourkarimi, Refail Kasimbeyli, Hadi Basirzadeh 

Publication date 24 August 2017

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-016-0495-4

zbMATH Keywords

coradiant setscalarizationapproximate efficient solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• A note on \(\varepsilon\)-properly efficient solutions in multi-objective optimization
• scientific article; zbMATH DE number 1500162
• Strict Benson proper-\(\varepsilon\)-efficiency in vector optimization with set-valued
• On several concepts for \(\varepsilon\)-efficiency
• scientific article; zbMATH DE number 1159049

Cites work

• 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?)
• A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
• A conic scalarization method in multi-objective optimization
• A generalization of ekellandz’s variational principle
• 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
• 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
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• \(\epsilon\)-solutions in vector minimization problems

Cited in

(8)

• Relationships between efficient set and \(\epsilon\)-efficient set
• Coradiant-valued maps and approximate solutions in variable ordering structures
• Extension of Zoutendijk method for solving constrained multiobjective optimization problems
• Quasi-Newton methods for multiobjective optimization problems
• The equivalent representation of co-radiant sets and its application in multi-objective optimization problems
• Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
• Duality in nonconvex vector optimization
• Approximate properly solutions of constrained vector optimization with variable coradiant sets

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)