An approximation algorithm for convex multi-objective programming problems
From MaRDI portal
Publication:548180
DOI10.1007/S10898-010-9588-7zbMATH Open1242.90210OpenAlexW2012902555MaRDI QIDQ548180FDOQ548180
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
Recommendations
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- A Benson type algorithm for nonconvex multiobjective programming problems
- Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
- Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
- Norm-based approximation in \(E\)-convex multi-objective programming
convex optimizationapproximation algorithmmulti-objective optimization\(\varepsilon\)-nondominated point
Cites Work
- Nonlinear multiobjective optimization
- Title not available (Why is that?)
- Multicriteria Optimization
- Proper efficiency and the theory of vector maximization
- A survey of recent developments in multiobjective optimization
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Approximation methods in multiobjective programming
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- Title not available (Why is that?)
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- On-line and off-line vertex enumeration by adjacency lists
Cited In (57)
- 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
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Outer approximation algorithms for convex vector optimization problems
- Title not available (Why is that?)
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Title not available (Why is that?)
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Advancements in the computation of enclosures for multi-objective optimization problems
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Title not available (Why is that?)
- An extension of the non-inferior set estimation algorithm for many objectives
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- Approximating the noninferior set in multiobjective linear programming problems
- Convex projection and convex multi-objective optimization
- Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
- Inner approximation algorithm for solving linear multiobjective optimization problems
- An objective space cut and bound algorithm for convex multiplicative programmes
- A Benson type algorithm for nonconvex multiobjective programming problems
- On the approximation of unbounded convex sets by polyhedra
- Some results on OMP algorithm for MMV problem
- Nonconvex constrained optimization by a filtering branch and bound
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- Approximating the convex Edgeworth-Pareto hull in integer multi-objective problems with monotone criteria
- Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy
- A norm minimization-based convex vector optimization algorithm
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle
- Primal and dual approximation algorithms for convex vector optimization problems
- Reference-point-based branch and bound algorithm for multiobjective optimization
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- Solving generalized convex multiobjective programming problems by a normal direction method
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- A complementarity constraint formulation of convex multiobjective optimization problems
- A constraint shifting homotopy method for convex multi-objective programming
- Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- An algorithmic approach to multiobjective optimization with decision uncertainty
- Approximating nondominated sets in continuous multiobjective optimization problems
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A deterministic algorithm for global multi-objective optimization
- Benson type algorithms for linear vector optimization and applications
- Weighted Multidimensional Search and Its Application to Convex Optimization
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- Title not available (Why is that?)
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- A parametric simplex algorithm for linear vector optimization problems
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Computing the recession cone of a convex upper image via convex projection
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- An approximation algorithm for multiobjective mixed-integer convex optimization
- Deep learning the efficient frontier of convex vector optimization problems
This page was built for publication: An approximation algorithm for convex multi-objective programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548180)
