A Benson type algorithm for nonconvex multiobjective programming problems

DOI10.1007/s11750-016-0430-3zbMath1372.90085OpenAlexW2512482484MaRDI QIDQ2408519

Narjes Shafiei, Soghra Nobakhtian

Publication date: 12 October 2017

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-016-0430-3

zbMATH Keywords

approximation algorithmmultiobjective optimizationefficient solutionnondominated point

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items

Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Efficient algorithms for solving nonlinear fractional programming problems ⋮ An exact algorithm for biobjective integer programming problems ⋮ Existence results and optimization over the set of efficient solutions in vector-valued approximation theory ⋮ Advancements in the computation of enclosures for multi-objective optimization problems ⋮ An extension of the non-inferior set estimation algorithm for many objectives

Uses Software

• BENSOLVE

Cites Work

• Unnamed Item
• Unnamed Item
• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• Primal and dual approximation algorithms for convex vector optimization problems
• An approximation algorithm for convex multi-objective programming problems
• Benson type algorithms for linear vector optimization and applications
• Generating the weakly efficient set of nonconvex multiobjective problems
• Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
• Approximating the nondominated set of an MOLP by approximately solving its dual problem
• Hybrid approach for solving multiple-objective linear programs in outcome space
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• First- and second-order optimality conditions for multiobjective fractional programming
• Approximation methods in multiobjective programming
• Vector Optimization with Infimum and Supremum
• Finding Efficient Solutions by Free Disposal Outer Approximation