Skip to main content
Book cover

Vector Optimization with Infimum and Supremum

  • Book
  • © 2011

Overview

  • 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

Part of the book series: Vector Optimization (VECTOROPT)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. General and Convex Problems

  2. Linear Problems

Keywords

About this book

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.

Authors and Affiliations

  • , NWF II - Institut für Mathematik, Martin-Luther-Universität Halle-Wittenbe, Halle (Saale), Germany

    Andreas Löhne

Bibliographic Information

Publish with us