An approximation algorithm for convex multi-objective programming problems
From MaRDI portal
Publication:548180
DOI10.1007/s10898-010-9588-7zbMath1242.90210MaRDI QIDQ548180
Lizhen Shao, Anita Schöbel, Matthias Ehrgott
Publication date: 28 June 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9588-7
multi-objective optimization; convex optimization; approximation algorithm; \(\varepsilon\)-nondominated point
Related Items
A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization, A Benson-type algorithm for bounded convex vector optimization problems with vertex selection, An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives, Solving Multiobjective Mixed Integer Convex Optimization Problems, Approximation of convex bodies by multiple objective optimization and an application in reachable sets, Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems, Algorithms to Solve Unbounded Convex Vector Optimization Problems, Advancements in the computation of enclosures for multi-objective optimization problems, Outer approximation algorithms for convex vector optimization problems, Twenty years of continuous multiobjective optimization in the twenty-first century, Reference-point-based branch and bound algorithm for multiobjective optimization, Primal and dual approximation algorithms for convex vector optimization problems, A parametric simplex algorithm for linear vector optimization problems, Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming, Benson type algorithms for linear vector optimization and applications, Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization, Discrete representation of the non-dominated set for multi-objective optimization problems using kernels, A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs, Tractability of convex vector optimization problems in the sense of polyhedral approximations, Nonconvex constrained optimization by a filtering branch and bound, Convex projection and convex multi-objective optimization, An approximation algorithm for multi-objective optimization problems using a box-coverage, A norm minimization-based convex vector optimization algorithm, Finding non dominated points for multiobjective integer convex programs with linear constraints, An algorithmic approach to multiobjective optimization with decision uncertainty, An objective space cut and bound algorithm for convex multiplicative programmes, An extension of the non-inferior set estimation algorithm for many objectives, A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle, A Benson type algorithm for nonconvex multiobjective programming problems, On the approximation of unbounded convex sets by polyhedra, Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes, Solving generalized convex multiobjective programming problems by a normal direction method, A deterministic algorithm for global multi-objective optimization, Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy
Cites Work
- Unnamed Item
- Unnamed Item
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- On-line and off-line vertex enumeration by adjacency lists
- 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
- Nonlinear multiobjective optimization
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- A survey of recent developments in multiobjective optimization
- Proper efficiency and the theory of vector maximization
- Approximation methods in multiobjective programming
- Multicriteria Optimization
