An approximation algorithm for convex multi-objective programming problems
From MaRDI portal
(Redirected from Publication:548180)
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
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A survey of recent developments in multiobjective optimization
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Approximation methods in multiobjective programming
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Improved -constraint method for multiobjective programming
- Multicriteria Optimization
- Nonlinear multiobjective optimization
- On-line and off-line vertex enumeration by adjacency lists
- Proper efficiency and the theory of vector maximization
Cited in
(69)- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- 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
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- 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
- A piecewise convexification method for non-convex multi-objective optimization programs with box constraints
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Outer approximation algorithms for convex vector optimization problems
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Method of centers algorithm for multi-objective programming problems
- scientific article; zbMATH DE number 3936958 (Why is no real title available?)
- Generalized inverse multiobjective optimization with application to cancer therapy
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- scientific article; zbMATH DE number 4130198 (Why is no real title available?)
- 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
- An extension of the non-inferior set estimation algorithm for many objectives
- Twenty years of continuous multiobjective optimization in the twenty-first century
- Advancements in the computation of enclosures for multi-objective optimization problems
- scientific article; zbMATH DE number 1859288 (Why is no real title available?)
- Computing the recession cone of a convex upper image via convex projection
- An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems
- A novel neural network model and two new algorithms for solving multiobjective linear optimization problems
- Tractability of convex vector optimization problems in the sense of polyhedral approximations
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Approximating the noninferior set in multiobjective linear programming problems
- Convex projection and convex multi-objective optimization
- Efficient approximation quality computation for sandwiching algorithms for convex multicriteria optimization
- An objective space cut and bound algorithm for convex multiplicative programmes
- Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank
- A Benson type algorithm for nonconvex multiobjective programming problems
- Inner approximation algorithm for solving linear multiobjective optimization problems
- On the approximation of unbounded convex sets by polyhedra
- Nonconvex constrained optimization by a filtering branch and bound
- Some results on OMP algorithm for MMV problem
- Enhancement of sandwich algorithms for approximating higher-dimensional convex Pareto sets
- Approximating the convex Edgeworth-Pareto hull in integer multi-objective problems with monotone criteria
- 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
- A norm minimization-based convex vector optimization algorithm
- An approximation to the nondominated set of a multiobjective linear fractional programming problem
- An algorithm for approximating nondominated points of convex multiobjective optimization problems
- 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
- Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
- Set contraction algorithm for computing Pareto set in nonconvex nonsmooth multiobjective optimization
- Finding efficient solutions by free disposal outer approximation
- Reference-point-based branch and bound algorithm for multiobjective optimization
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- Norm-based approximation in E-convex multi-objective programming
- 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
- A constraint shifting homotopy method for convex multi-objective programming
- A complementarity constraint formulation of convex multiobjective optimization problems
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- 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
- Benson type algorithms for linear vector optimization and applications
- A deterministic algorithm for global multi-objective optimization
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Approximating nondominated sets in continuous multiobjective optimization problems
- Solving multiobjective mixed integer convex optimization problems
- Weighted Multidimensional Search and Its Application to Convex Optimization
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- A parametric simplex algorithm for linear vector optimization problems
- scientific article; zbMATH DE number 5954531 (Why is no real title available?)
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)
