The vector linear program solver Bensolve -- notes on theoretical background

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Löhne, Andreas, Weißing, Benjamin
Formato: Preprint
Publicado: 2015
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909082305167360
author Löhne, Andreas
Weißing, Benjamin
author_facet Löhne, Andreas
Weißing, Benjamin
contents Bensolve is an open source implementation of Benson's algorithm and its dual variant. Both algorithms compute primal and dual solutions of vector linear programs (VLP), which include the subclass of multiple objective linear programs (MOLP). The recent version of Bensolve can treat arbitrary vector linear programs whose upper image does not contain lines. This article surveys the theoretical background of the implementation. In particular, the role of VLP duality for the implementation is pointed out. Some numerical examples are provided.
format Preprint
id arxiv_https___arxiv_org_abs_1510_04823
institution arXiv
publishDate 2015
record_format arxiv
spellingShingle The vector linear program solver Bensolve -- notes on theoretical background
Löhne, Andreas
Weißing, Benjamin
Optimization and Control
90C29, 90C05, 52B55, 15A39
Bensolve is an open source implementation of Benson's algorithm and its dual variant. Both algorithms compute primal and dual solutions of vector linear programs (VLP), which include the subclass of multiple objective linear programs (MOLP). The recent version of Bensolve can treat arbitrary vector linear programs whose upper image does not contain lines. This article surveys the theoretical background of the implementation. In particular, the role of VLP duality for the implementation is pointed out. Some numerical examples are provided.
title The vector linear program solver Bensolve -- notes on theoretical background
topic Optimization and Control
90C29, 90C05, 52B55, 15A39
url https://arxiv.org/abs/1510.04823