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

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

zbMATH Keywords

coradiant setscalarizationapproximate efficient solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites Work

• Nonlinear multiobjective optimization
• Multicriteria optimization
• Title not available (Why is that?)
• \(\epsilon\)-solutions in vector minimization problems
• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• Adaptive Scalarization Methods in Multiobjective Optimization
• Title not available (Why is that?)
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
• A generalization of ekellandz’s variational principle
• Epsilon efficiency
• Approximation of solutions for location problems
• Title not available (Why is that?)
• A conic scalarization method in multi-objective optimization
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
• Approximate saddle-point theorems in vector optimization
• Title not available (Why is that?)
• On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
• A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
• Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
• On approximate efficiency in multiobjective programming
• The Nonlinear Separation Theorem and a Representation Theorem for Bishop–Phelps Cones
• Title not available (Why is that?)
• \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
• Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization

Cited In (7)

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

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)