Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
Ivo Nowak
€ 128.21
FREE Delivery in Ireland
Description for Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
Hardback. Presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). This book focuses on deterministic global optimization methods, which play a very important role in integer linear programming. It describes basic optimization tools and algorithms. Series: International Series of Numerical Mathematics. Num Pages: 229 pages, 29 black & white tables, biography. BIC Classification: PB. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 504.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
2005
Publisher
Birkhauser Verlag AG Switzerland
Number of pages
229
Condition
New
Series
International Series of Numerical Mathematics
Number of Pages
213
Place of Publication
Basel, Switzerland
ISBN
9783764372385
SKU
V9783764372385
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
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 ... Read more