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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 28,74 expédition depuis Royaume-Uni vers Etats-Unis
Destinations, frais et délaisGratuit expédition vers Etats-Unis
Destinations, frais et délaisVendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-84264
Quantité disponible : 1 disponible(s)
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEOCT25-153319
Quantité disponible : 1 disponible(s)
Vendeur : ALLBOOKS1, Direk, SA, Australie
Brand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address. N° de réf. du vendeur SHAK153319
Quantité disponible : 1 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar2411530141483
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 1043590-n
Quantité disponible : 15 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781402010316_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
Hardcover. Etat : new. Hardcover. This title provides a comprehensive treatment of convexification and global optimization of continuous and mixed-integer nonlinear programs. Developed for students, researchers, and practitioners, the book covers theory, algorithms, software, and applications.The book: develops a powerful and widely applicable framework for constructing closed-form expressions of convex envelopes of nonlinear functions; presents a systematic treatment of branch-and-bound, while providing acceleration mechanisms and enhancements; unifies ideas at the interface between operations research and computer science, devising efficient algorithmic implementation for global optimization; offers students, modellers, and algorithm developers a rich collection of models, applications, and numerical examples; elucidates through geometric interpretations the concepts discussed throughout the book; shows how optimization theory can lead to breakthroughs in diverse application areas, including molecular design, process and product design, facility location, and supply chain design and operation; and demonstrates that the BARON software developed by the authors can solve global optimization problems heretofore considered intractable, in an entirely automated manner on a personal computer. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9781402010316
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. N° de réf. du vendeur 67412078
Quantité disponible : Plus de 20 disponibles
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. Provides a treatment of convexification and global optimization of continuous and mixed-integer nonlinear programs. Series: Nonconvex Optimization and Its Applications. Num Pages: 503 pages, 89 black & white illustrations. BIC Classification: PBU; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 28. Weight in Grams: 885. . 2002. Hardback. . . . . N° de réf. du vendeur V9781402010316
Quantité disponible : 15 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. Provides a treatment of convexification and global optimization of continuous and mixed-integer nonlinear programs. Series: Nonconvex Optimization and Its Applications. Num Pages: 503 pages, 89 black & white illustrations. BIC Classification: PBU; PBW; UM. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 155 x 28. Weight in Grams: 885. . 2002. Hardback. . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9781402010316
Quantité disponible : 15 disponible(s)