Vector Optimization with Infimum and Supremum

Beschreibung

The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power set, in fact, the space of self-infimal sets. Based on this idea we establish solution concepts, existence and duality results and algorithms for the linear case. The main advantage of this approach is the high degree of analogy to corresponding results of Scalar Optimization. The concepts and results are used to explain and to improve practically relevant algorithms for linear vector optimization problems.
The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power set, in fact, the space of self-infimal sets. Based on this idea we establish solution concepts, existence and duality results and algorithms for the linear case. The main advantage of this approach is the high degree of analogy to corresponding results of Scalar Optimization. The concepts and results are used to explain and to improve practically relevant algorithms for linear vector optimization problems.
Presents a completely new approach to Vector Optimization Covers the range from theory to algorithms Includes a self-contained chapter on the linear case Includes supplementary material: sn.pub/extras

Autor*in

Andreas Löhne

Themen in »Vector Optimization with Infimum and Supremum«

complete lattice cutting plane methods duality multiobjective optimization self-infimal sets

Stimmen zu »Vector Optimization with Infimum and Supremum«

Details

Link teilen