000 02354nam a22005055i 4500
001 978-3-642-18351-5
003 DE-He213
005 20140220083753.0
007 cr nn 008mamaa
008 110524s2011 gw | s |||| 0|eng d
020 _a9783642183515
_9978-3-642-18351-5
024 7 _a10.1007/978-3-642-18351-5
_2doi
050 4 _aHD30.23
072 7 _aKJT
_2bicssc
072 7 _aKJMD
_2bicssc
072 7 _aBUS049000
_2bisacsh
082 0 4 _a658.40301
_223
100 1 _aLöhne, Andreas.
_eauthor.
245 1 0 _aVector Optimization with Infimum and Supremum
_h[electronic resource] /
_cby Andreas Löhne.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2011.
300 _aX, 206 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aVector Optimization,
_x1867-8971
520 _aThe 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.
650 0 _aEconomics.
650 0 _aAlgebra.
650 0 _aAlgorithms.
650 0 _aMathematical optimization.
650 1 4 _aEconomics/Management Science.
650 2 4 _aOperations Research/Decision Theory.
650 2 4 _aOptimization.
650 2 4 _aOrder, Lattices, Ordered Algebraic Structures.
650 2 4 _aOperations Research, Management Science.
650 2 4 _aAlgorithms.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642183508
830 0 _aVector Optimization,
_x1867-8971
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-18351-5
912 _aZDB-2-SBE
999 _c107419
_d107419