000			03964nam a22004695i 4500
001			978-1-4614-1927-3
003			DE-He213
005			20140220083244.0
007			cr nn 008mamaa
008			111201s2012 xxu| s |||| 0|eng d
020			_a9781461419273 _9978-1-4614-1927-3
024	7		_a10.1007/978-1-4614-1927-3 _2doi
050		4	_aQA401-425
072		7	_aPBKJ _2bicssc
072		7	_aMAT034000 _2bisacsh
082	0	4	_a511.4 _223
100	1		_aLee, Jon. _eeditor.
245	1	0	_aMixed Integer Nonlinear Programming _h[electronic resource] / _cedited by Jon Lee, Sven Leyffer.
264		1	_aNew York, NY : _bSpringer New York, _c2012.
300			_aXVII, 690p. 82 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aThe IMA Volumes in Mathematics and its Applications, _x0940-6573 ; _v154
505	0		_aForeword -- Preface.-Algorithms and software for convex mixed integer nonlinearprograms.-  Subgradient based outer approximation for mixed integer secondorder cone programming.-Perspective reformulation and applications -- Generalized disjunctive programming: A framework for formulation and alternative algorithms for MINLP optimization.-Disjunctive cuts for nonconvex MINLP -- Sequential quadratic programming methods -- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming -- Using expression graphs in optimization algorithms -- Symmetry in mathematical programming -- Using piecewise linear functions for solving MINLPs -- An algorithmic framework for MINLP with separable non-convexity -- Global optimization of mixed-integer signomial programming problems.-The MILP road to MIQCP -- Linear programming relaxations of quadratically constrained quadratic programs -- Extending a CIP framework to solve MIQCPs -- Computation with polynomial equations and inequalities arisingin combinatorial optimization.-  Matrix relaxations in combinatorial optimization -- A polytope for a product of real linear functions in 0/1 variables -- On the complexity of nonlinear mixed-integer optimization -- Theory and applications of n-fold integer programming -- MINLP Application for ACH interiors restructuring -- A benchmark library of mixed-integer optimal control problems.
520			_aMany engineering, operations, and scientific applications include a mixture of discrete and continuous decision variables and nonlinear relationships involving the decision variables that have a pronounced effect on the set of feasible and optimal solutions. Mixed-integer nonlinear programming (MINLP) problems combine the numerical difficulties of handling nonlinear functions with the challenge of optimizing in the context of nonconvex functions and discrete variables. MINLP is one of the most flexible modeling paradigms available for optimization; but because its scope is so broad, in the most general cases it is hopelessly intractable. Nonetheless, an expanding body of researchers and practitioners — including chemical engineers, operations researchers, industrial engineers, mechanical engineers, economists, statisticians, computer scientists, operations managers, and mathematical programmers — are interested in solving large-scale MINLP instances.
650		0	_aMathematics.
650		0	_aAlgorithms.
650	1	4	_aMathematics.
650	2	4	_aApproximations and Expansions.
650	2	4	_aAlgorithms.
650	2	4	_aContinuous Optimization.
700	1		_aLeyffer, Sven. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781461419266
830		0	_aThe IMA Volumes in Mathematics and its Applications, _x0940-6573 ; _v154
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4614-1927-3
912			_aZDB-2-SMA
999			_c101162 _d101162