0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R5,000 - R10,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming - Theory, Algorithms, Software,... Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming - Theory, Algorithms, Software, and Applications (Hardcover, 2002 ed.)
Mohit Tawarmalani, Nikolaos V. Sahinidis
R5,542 Discovery Miles 55 420 Ships in 10 - 15 working days

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."

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming - Theory, Algorithms, Software,... Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming - Theory, Algorithms, Software, and Applications (Paperback, Softcover reprint of the original 1st ed. 2002)
Mohit Tawarmalani, Nikolaos V. Sahinidis
R5,490 Discovery Miles 54 900 Ships in 10 - 15 working days

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."

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Bostik Glue Stick - Loose (25g)
R31 R19 Discovery Miles 190
Bettaway Mega C1000 Fizzi Effervescent…
R62 Discovery Miles 620
Rocks-Off RO-80mm 7 Speed (Rainbow)
 (8)
R339 R229 Discovery Miles 2 290
Bostik Correction Tape (5mm x 8m)
R33 Discovery Miles 330
Harry Potter Wizard Wand - In…
 (3)
R800 Discovery Miles 8 000
Return Of The Dream Canteen
Red Hot Chili Peppers CD R127 Discovery Miles 1 270
ZA Cute Puppy Love Paw Set (Necklace…
R712 R499 Discovery Miles 4 990
Loot
Nadine Gordimer Paperback  (2)
R383 R318 Discovery Miles 3 180
Loot
Nadine Gordimer Paperback  (2)
R383 R318 Discovery Miles 3 180
Bad Boy Men's Smoke Watch & Sunglass Set…
 (3)
R489 Discovery Miles 4 890

 

Partners