Geometric Duality for Convex Vector Optimization Problems
Optimization and Control
2011-09-19 v1
Abstract
Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space. This article extends the geometric duality theory to convex vector optimization problems.
Cite
@article{arxiv.1109.3592,
title = {Geometric Duality for Convex Vector Optimization Problems},
author = {Frank Heyde},
journal= {arXiv preprint arXiv:1109.3592},
year = {2011}
}
Comments
21 pages