0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Algebra

Buy Now

Vector Optimization with Infimum and Supremum (Hardcover, 2011 Ed.) Loot Price: R3,036
Discovery Miles 30 360
Vector Optimization with Infimum and Supremum (Hardcover, 2011 Ed.): Andreas Loehne

Vector Optimization with Infimum and Supremum (Hardcover, 2011 Ed.)

Andreas Loehne

Series: Vector Optimization

 (sign in to rate)
Loot Price R3,036 Discovery Miles 30 360 | Repayment Terms: R285 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Vector Optimization
Release date: May 2011
First published: 2011
Authors: Andreas Loehne
Dimensions: 235 x 155 x 14mm (L x W x T)
Format: Hardcover
Pages: 206
Edition: 2011 Ed.
ISBN-13: 978-3-642-18350-8
Categories: Books > Science & Mathematics > Mathematics > Numerical analysis
Books > Science & Mathematics > Mathematics > Algebra > General
Books > Science & Mathematics > Mathematics > Optimization > General
LSN: 3-642-18350-6
Barcode: 9783642183508

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners