Inner approximation algorithm for solving linear multiobjective optimization problems

Benson's outer approximation algorithm and its variants are the most frequently used methods for solving linear multiobjective optimization problems. These algorithms have two intertwined parts: single-objective linear optimization on one hand, and a combinatorial part closely related to vertex...

Full description

Bibliographic Details

Published in:	Optimization Vol. 70; no. 7; pp. 1487 - 1511
Main Author:	Csirmaz, Laszlo
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis 03.07.2021 Taylor & Francis LLC
Subjects:	Algorithms Approximation Combinatorial analysis Computational geometry Convexity double description duality Enumeration Linear programming Mathematical analysis Multiobjective optimization Multiple objective analysis objective space Optimization vertex enumeration
ISSN:	0233-1934, 1029-4945
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!