A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem

DOI10.3934/naco.2022039zbMATH Open1542.90214MaRDI QIDQ6559157

Unnamed Author, Alireza Hosseini Dehmiry

Publication date: 21 June 2024

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

zbMATH Keywords

Benson's methodnon-dominated pointouter approximation of non-dominated setpolyblocks

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• The normalized normal constraint method for generating the Pareto frontier
• Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
• An approximation algorithm for convex multi-objective programming problems
• Benson type algorithms for linear vector optimization and applications
• On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
• Theory of multiobjective optimization
• A new Pareto set generating method for multi-criteria optimization problems
• A Benson type algorithm for nonconvex multiobjective programming problems
• Finding Efficient Solutions by Free Disposal Outer Approximation
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• Physical programming - Effective optimization for computational design
• Multicriteria Optimization
• Convex analysis and global optimization

This page was built for publication: A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem