Tractability of convex vector optimization problems in the sense of polyhedral approximations
From MaRDI portal
Publication:1756800
DOI10.1007/s10898-018-0666-6zbMath1404.90125arXiv1702.05645OpenAlexW2590334092WikidataQ57612115 ScholiaQ57612115MaRDI QIDQ1756800
Publication date: 27 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.05645
Related Items (5)
A Benson-type algorithm for bounded convex vector optimization problems with vertex selection ⋮ Convex projection and convex multi-objective optimization ⋮ On the approximation of unbounded convex sets by polyhedra ⋮ Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Polyhedral approximation of spectrahedral shadows via homogenization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- Primal and dual approximation algorithms for convex vector optimization problems
- A parametric simplex algorithm for linear vector optimization problems
- An approximation algorithm for convex multi-objective programming problems
- Benson type algorithms for linear vector optimization and applications
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Hpyerbolic sets and asymptotes
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Primal-dual simplex method for multiobjective linear programming
- Set Optimization—A Rather Short Introduction
- Geometric Duality for Convex Vector Optimization Problems
- Vector Optimization with Infimum and Supremum
- Solution concepts in vector optimization: a fresh look at an old story
- Geometric Duality in Multiple Objective Linear Programming
- A revised simplex method for linear multiple objective programs
- Norm-closure of the barrier cone in normed linear spaces
This page was built for publication: Tractability of convex vector optimization problems in the sense of polyhedral approximations
