Convexification and Global Optimization in Continuous and

Condition - Very Good
The item shows wear from consistent use, but it remains in good condition and functions properly. Item may arrive with damaged packaging or be repackaged. It may be marked, have identifying markings on it, or have minor cosmetic damage. It may also be missing some parts/accessories or bundled items.

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications (Nonconvex Optimization and Its Applications, 65)

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.
Country USA
Brand Springer
Manufacturer Springer
Binding Hardcover
ItemPartNumber Refer to Sapnet.
ReleaseDate 2002-10-31
UnitCount 1
EANs 9781402010316

Country	USA
Brand	Springer
Manufacturer	Springer
Binding	Hardcover
ItemPartNumber	Refer to Sapnet.
ReleaseDate	2002-10-31
UnitCount	1
EANs	9781402010316

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications (Nonconvex Optimization and Its Applications, 65)

Customers who purchased this also purchased....