Cart
Free US shipping over $10
Proud to be B-Corp

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming Mohit Tawarmalani

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming By Mohit Tawarmalani

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming by Mohit Tawarmalani


$276.09
Condition - New
Only 2 left

Summary

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.

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming Summary

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications by Mohit Tawarmalani

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.

Table of Contents

1 Introduction.- 2 Convex Extensions.- 3 Product 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 Models for Pooling Problems.- A.1 Problems Adhya 1, 2, 3, and 4.- A.2 Problems Bental 4 and 5.- A.3 Problems Foulds 2, 3, 4, and 5.- A.4 Problems Haverly 1, 2, and 3.- A.5 Problem RT 2.- Author Index.

Additional information

NPB9781441952356
9781441952356
1441952357
Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications by Mohit Tawarmalani
New
Paperback
Springer-Verlag New York Inc.
2011-09-21
478
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Customer Reviews - Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming