عنوان

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

(Number (ISBN

9781441952356

(Number (ISBN

9781475735321

Number

b402370

Title Proper

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

General Material Designation

[Book]

Other Title Information

Theory, Algorithms, Software, and Applications /

First Statement of Responsibility

by Mohit Tawarmalani, Nikolaos V. Sahinidis.

Place of Publication, Distribution, etc.

Boston, MA :

Name of Publisher, Distributor, etc.

Imprint: Springer,

Date of Publication, Distribution, etc.

2002.

Series Title

Nonconvex Optimization and Its Applications,

Volume Designation

65

ISSN of Series

1571-568X ;

Text of Note

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.

0

Text of Note

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.

International Standard Book Number

9781441952356

Title

Springer eBooks

Chemistry.

Discrete groups.

Electronic data processing.

Mathematical optimization.

Mathematics.

Operations research.

Tawarmalani, Mohit.

Sahinidis, Nikolaos V.

SpringerLink (Online service)

Date of Transaction

20190301080200.0

Electronic name

[Book]

Y