Visit our Christmas Gift Finder
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming - International Series of Numerical Mathematics 152 (Hardback)
  • Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming - International Series of Numerical Mathematics 152 (Hardback)
zoom

Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming - International Series of Numerical Mathematics 152 (Hardback)

(author)
£117.00
Hardback 213 Pages / Published: 15/08/2005
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Birkhauser Verlag AG
ISBN: 9783764372385
Number of pages: 213
Weight: 514 g
Dimensions: 234 x 156 x 14 mm
Edition: 2005 ed.


MEDIA REVIEWS

From the reviews:

"In his monograph, the author treats mixed integer nonlinear programs (MINLPs), that is nonlinear optimization problems containing both continuous and discrete variables. ... This self-contained monograph is rich in content, provides the reader with a wealth of information, and motivates his or her further interest in the subject. The book offers fairly comprehensive description of the MINLP theory and algorithms." (Jan Chleboun, Applications of Mathematics, Issue 3, 2012)

You may also be interested in...

The Economist Numbers Guide 6th Edition
Added to basket
Mathematics for Economists
Added to basket
Essential Medical Statistics
Added to basket
Mathematics for Biological Scientists
Added to basket
Networks: A Very Short Introduction
Added to basket
Probability
Added to basket
£26.49
Paperback
Advanced Engineering Mathematics
Added to basket
Chaos: A Very Short Introduction
Added to basket
Schaum's Outline of Numerical Analysis
Added to basket
Mathematical Techniques
Added to basket
Probability and Random Processes
Added to basket
Mathematics for Economics and Finance
Added to basket
Linear Algebra
Added to basket
£31.49
Paperback

Reviews

Please sign in to write a review

Your review has been submitted successfully.