Books > Science & Mathematics > Mathematics > Applied mathematics
|
Buy Now
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (Hardcover, 2005 ed.)
Loot Price: R2,940
Discovery Miles 29 400
|
|
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (Hardcover, 2005 ed.)
Series: International Series of Numerical Mathematics, 152
Expected to ship within 10 - 15 working days
|
Nonlinearoptimizationproblemscontainingbothcontinuousanddiscretevariables
are called mixed integer nonlinear programs (MINLP). Such problems
arise in many ?elds, such as process industry, engineering design,
communications, and ?nance. There is currently a huge gap between
MINLP and mixed integer linear programming(MIP)
solvertechnology.With a modernstate-of-the-artMIP solver
itispossibletosolvemodelswithmillionsofvariablesandconstraints,whereasthe
dimensionofsolvableMINLPsisoftenlimitedbyanumberthatissmallerbythree
or four orders of magnitude. It is theoretically possible to
approximate a general MINLP by a MIP with arbitrary precision.
However, good MIP approximations are usually much larger than the
original problem. Moreover, the approximation of nonlinear
functions by piecewise linear functions can be di?cult and ti-
consuming. In this book relaxation and decomposition methods for
solving nonconvex structured MINLPs are proposed. In particular, a
generic branch-cut-and-price (BCP) framework for MINLP is
presented. BCP is the underlying concept in almost all modern MIP
solvers. Providing a powerful decomposition framework for both
sequential and parallel solvers, it made the success of the current
MIP technology possible. So far generic BCP frameworks have been
developed only for MIP, for example,COIN/BCP (IBM, 2003) andABACUS
(OREAS GmbH, 1999). In order to generalize MIP-BCP to MINLP-BCP,
the following points have to be taken into account: * A given
(sparse) MINLP is reformulated as a block-separable program with
linear coupling constraints.The block structure makes it possible
to generate Lagrangian cuts and to apply Lagrangian heuristics. *
In order to facilitate the generation of polyhedral relaxations,
nonlinear c- vex relaxations are constructed. * The MINLP
separation and pricing subproblems for generating cuts and columns
are solved with specialized MINLP solvers.
General
Imprint: |
Birkhauser Verlag AG
|
Country of origin: |
Switzerland |
Series: |
International Series of Numerical Mathematics, 152 |
Release date: |
August 2005 |
First published: |
2005 |
Authors: |
Ivo Nowak
|
Dimensions: |
235 x 155 x 14mm (L x W x T) |
Format: |
Hardcover
|
Pages: |
213 |
Edition: |
2005 ed. |
ISBN-13: |
978-3-7643-7238-5 |
Categories: |
Books >
Science & Mathematics >
Mathematics >
Applied mathematics >
General
Promotions
|
LSN: |
3-7643-7238-9 |
Barcode: |
9783764372385 |
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!
|
You might also like..
|