Showing 1 - 5 of 5
Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson’s outer approximation algorithm, and the second one is a dual variant...
Persistent link: https://www.econbiz.de/10011151248
We develop a duality theory for weakly minimal points of multiple objective linear programs which has several … are hyperplanes. As in other set-valued (but not in vector-valued) approaches, there is no duality gap in the case that … in a complete lattice. Thus the duality theory has a high degree of analogy to its classical counterpart. Another …
Persistent link: https://www.econbiz.de/10010759327
Persistent link: https://www.econbiz.de/10010994025
New versions and extensions of Benson’s outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each iteration rather than two or three as in previous...
Persistent link: https://www.econbiz.de/10010994156
We develop a duality theory for weakly minimal points of multiple objective linear programs which has several … are hyperplanes. As in other set-valued (but not in vector-valued) approaches, there is no duality gap in the case that … in a complete lattice. Thus the duality theory has a high degree of analogy to its classical counterpart. Another …
Persistent link: https://www.econbiz.de/10010999730