عنوان

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

شابک

9781441952356

شابک

9781475735321

شماره

b402370

عنوان اصلي

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

نام عام مواد

[Book]

ساير اطلاعات عنواني

Theory, Algorithms, Software, and Applications /

نام نخستين پديدآور

by Mohit Tawarmalani, Nikolaos V. Sahinidis.

محل نشرو پخش و غیره

Boston, MA :

نام ناشر، پخش کننده و غيره

Imprint: Springer,

تاریخ نشرو بخش و غیره

2002.

عنوان فروست

Nonconvex Optimization and Its Applications,

مشخصه جلد

65

شاپا ي ISSN فروست

1571-568X ;

متن يادداشت

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

متن يادداشت

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.

شماره استاندارد بين المللي کتاب و موسيقي

9781441952356

عنوان

Springer eBooks

موضوع مستند نشده

Chemistry.

موضوع مستند نشده

Discrete groups.

موضوع مستند نشده

Electronic data processing.

موضوع مستند نشده

Mathematical optimization.

موضوع مستند نشده

Mathematics.

موضوع مستند نشده

Operations research.

مستند نام اشخاص تاييد نشده

Tawarmalani, Mohit.

مستند نام اشخاص تاييد نشده

Sahinidis, Nikolaos V.

مستند نام تنالگان تاييد نشده

SpringerLink (Online service)

تاريخ عمليات

20190301080200.0

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y