Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications: 65 - Rilegato

Tawarmalani, Mohit; Sahinidis, Nikolaos V.

 
9781402010316: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications: 65
Rilegato
ISBN 10: 1402010311 ISBN 13: 9781402010316
Casa editrice: Kluwer Academic Publishers, 2002

Sinossi

Interest in constrained optimization originated with the simple linear pro­ gramming model since it was practical and perhaps the only computationally tractable model at the time. Constrained linear optimization models were soon adopted in numerous application areas and are perhaps the most widely used mathematical models in operations research and management science at the time of this writing. Modelers have, however, found the assumption of linearity to be overly restrictive in expressing the real-world phenomena and problems in economics, finance, business, communication, engineering design, computational biology, and other areas that frequently demand the use of nonlinear expressions and discrete variables in optimization models. Both of these extensions of the linear programming model are NP-hard, thus representing very challenging problems. On the brighter side, recent advances in algorithmic and computing technology make it possible to re­ visit these problems with the hope of solving practically relevant problems in reasonable amounts of computational time. Initial attempts at solving nonlinear programs concentrated on the de­ velopment of local optimization methods guaranteeing globality under the assumption of convexity. On the other hand, the integer programming liter­ ature has concentrated on the development of methods that ensure global optima. The aim of this book is to marry the advancements in solving nonlinear and integer programming models and to develop new results in the more general framework of mixed-integer nonlinear programs (MINLPs) with the goal of devising practically efficient global optimization algorithms for MINLPs.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

Preface. Acknowledgements. List of Figures. List of Tables. 1. Introduction. 2. Convex Extensions. 3. Project Disaggregation. 4. Relaxations of Factorable Programs. 5. Domain Reduction. 6. Node Partitioning. 7. Implementation. 8. Refrigerant Design Problem. 9. The Pooling Problem. 10. Miscellaneous Problems. 11. GAMS/BARON: A Tutorial. A: GAMS Model for Pooling Problems. Bibliography. Index. Author Index.

Product Description

Rare book

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Kluwer Academic Publishers
Data di pubblicazione
2002
Lingua
Inglese
ISBN 10 
1402010311
ISBN 13 
9781402010316
Rilegatura
Copertina rigida
Numero di pagine
478
Contatto del produttore
Elevation
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
22391
Germania

Altre edizioni note dello stesso titolo

9781441952356: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications: 65

Edizione in evidenza

ISBN 10:  1441952357 ISBN 13:  9781441952356
Casa editrice: Springer, 2011
Brossura