Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets

DOI10.1287/IJOC.1100.0419zbMATH Open1243.90204OpenAlexW2105843740MaRDI QIDQ2899142FDOQ2899142

Authors: Gijs Rennen, Edwin R. Van Dam, D. Den Hertog 

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

Recommendations

• An approximation algorithm for convex multi-objective programming problems
• An algorithm for approximating nondominated points of convex multiobjective optimization problems
• Approximation of multi-dimensional Edgeworth-Pareto hull in non-linear multi-objective problems
• Set oriented methods for the numerical treatment of multiobjective optimization problems
• Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems

zbMATH Keywords

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

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cited In (9)

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

Uses Software

• CPLEX
• Qhull

This page was built for publication: Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899142)