Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets

DOI10.1287/ijoc.1100.0419zbMath1243.90204OpenAlexW2105843740MaRDI QIDQ2899142

Dick den Hertog, van Dam, Edwin R., Gijs Rennen

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8cdb883b1a589f48c5cff64cc626998141b90d0d

zbMATH Keywords

convexitygeometric programming\(\varepsilon \)-efficiency\(\epsilon \)-Pareto optimality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (8)

Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy ⋮ Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods ⋮ Multi-criteria optimization and decision-making in radiotherapy ⋮ Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes ⋮ Approximating the Pareto set of multiobjective linear programs via robust optimization ⋮ Multi-objective optimization of long-run average and total rewards ⋮ Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems ⋮ An extension of the non-inferior set estimation algorithm for many objectives

Uses Software

• CPLEX
• Qhull

This page was built for publication: Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets