Tractability of convex vector optimization problems in the sense of polyhedral approximations
From MaRDI portal
Abstract: There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finitely many efficient solutions that generate polyhedral inner and outer approximations to the Pareto frontier. A CVOP with compact feasible region is known to be bounded and there exists a solution of this sense to it. However, it is not known if it is possible to generate polyhedral inner and outer approximations to the Pareto frontier of a CVOP if the feasible region is not compact. This study shows that not all CVOPs are tractable in that sense and gives a characterization of tractable problems in terms of the well known weighted sum scalarization problems.
Recommendations
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- Primal and dual approximation algorithms for convex vector optimization problems
- Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
- On convex vector optimization problems with possibilistic weights
- A norm minimization-based convex vector optimization algorithm
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A parametric simplex algorithm for linear vector optimization problems
- A revised simplex method for linear multiple objective programs
- An approximation algorithm for convex multi-objective programming problems
- 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
- Benson type algorithms for linear vector optimization and applications
- Convex radiant costarshaped sets and the least sublinear gauge
- Geometric Duality in Multiple Objective Linear Programming
- Geometric duality for convex vector optimization problems
- Hpyerbolic sets and asymptotes
- Norm-closure of the barrier cone in normed linear spaces
- Primal and dual approximation algorithms for convex vector optimization problems
- Primal-dual simplex method for multiobjective linear programming
- Set Optimization—A Rather Short Introduction
- Solution concepts in vector optimization: a fresh look at an old story
- Vector Optimization with Infimum and Supremum
Cited in
(9)- Polyhedral approximation of spectrahedral shadows via homogenization
- Computing the recession cone of a convex upper image via convex projection
- Convex projection and convex multi-objective optimization
- On the approximation of unbounded convex sets by polyhedra
- Tractability for Volterra problems of the second kind with convolution kernels
- An approximation algorithm for multiobjective mixed-integer convex optimization
- Deep learning the efficient frontier of convex vector optimization problems
- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
This page was built for publication: Tractability of convex vector optimization problems in the sense of polyhedral approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756800)
