Seller: Bookmonger.Ltd, HILLSIDE, NJ, U.S.A.
hardcover. Condition: Very Good. Crease on cover*.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
US$ 117.78
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 116.44
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 135.52
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 135.51
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 232.
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 128.25
Convert currencyQuantity: 1 available
Add to basketBuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Nonlinearoptimizationproblemscontainingbothcontinuousanddiscretevar iables are called mixed integer nonlinear programs (MINLP). Such problems arise in many elds, such as process industry, engineering design, communications, and nance. There is currently a huge gap between MINLP and mixed integer linear programming(MIP) solvertechnology.With a modernstate-of-the-artMIP solver itispossibletosolvemodelswithmillionsofvariablesandconstraints,whereasthe dimensionofsolvableMINLPsisoftenlimitedbyanumberthatissmallerbythree or four orders of magnitude. It is theoretically possible to approximate a general MINLP by a MIP with arbitrary precision. However, good MIP approximations are usually much larger than the original problem. Moreover, the approximation of nonlinear functions by piecewise linear functions can be di cult and ti- consuming. In this book relaxation and decomposition methods for solving nonconvex structured MINLPs are proposed. In particular, a generic branch-cut-and-price (BCP) framework for MINLP is presented. BCP is the underlying concept in almost all modern MIP solvers. Providing a powerful decomposition framework for both sequential and parallel solvers, it made the success of the current MIP technology possible. So far generic BCP frameworks have been developed only for MIP, for example,COIN/BCP (IBM, 2003) andABACUS (OREAS GmbH, 1999). In order to generalize MIP-BCP to MINLP-BCP, the following points have to be taken into account: - A given (sparse) MINLP is reformulated as a block-separable program with linear coupling constraints.The block structure makes it possible to generate Lagrangian cuts and to apply Lagrangian heuristics. - In order to facilitate the generation of polyhedral relaxations, nonlinear c- vex relaxations are constructed.- The MINLP separation and pricing subproblems for generating cuts and columns are solved with specialized MINLP solvers.
Seller: Revaluation Books, Exeter, United Kingdom
US$ 178.03
Convert currencyQuantity: 2 available
Add to basketHardcover. Condition: Brand New. 1st edition. 213 pages. 9.25x6.50x0.75 inches. In Stock.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 206.83
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 195.74
Convert currencyQuantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
US$ 226.37
Convert currencyQuantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Seller: Majestic Books, Hounslow, United Kingdom
US$ 155.69
Convert currencyQuantity: 4 available
Add to basketCondition: New. Print on Demand pp. 232 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Seller: moluna, Greven, Germany
US$ 110.61
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents the first branch-cut-and-price algorithm for mixed integer nonlinear programming (MINLP)Several new MINLP cuts based on semidefinite programming, interval-gradients and Bezier polynomials are proposedA description of the MINLP solv.
Seller: Biblios, Frankfurt am main, HESSE, Germany
US$ 169.18
Convert currencyQuantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. 232.
Published by Springer, Basel, Birkhäuser Basel, Birkhäuser Aug 2005, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
US$ 166.68
Convert currencyQuantity: 2 available
Add to basketBuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Nonlinearoptimizationproblemscontainingbothcontinuousanddiscretevariables are called mixed integer nonlinear programs (MINLP). Such problems arise in many elds, such as process industry, engineering design, communications, and nance. There is currently a huge gap between MINLP and mixed integer linear programming(MIP) solvertechnology.With a modernstate-of-the-artMIP solver itispossibletosolvemodelswithmillionsofvariablesandconstraints,whereasthe dimensionofsolvableMINLPsisoftenlimitedbyanumberthatissmallerbythree or four orders of magnitude. It is theoretically possible to approximate a general MINLP by a MIP with arbitrary precision. However, good MIP approximations are usually much larger than the original problem. Moreover, the approximation of nonlinear functions by piecewise linear functions can be di cult and ti- consuming. In this book relaxation and decomposition methods for solving nonconvex structured MINLPs are proposed. In particular, a generic branch-cut-and-price (BCP) framework for MINLP is presented. BCP is the underlying concept in almost all modern MIP solvers. Providing a powerful decomposition framework for both sequential and parallel solvers, it made the success of the current MIP technology possible. So far generic BCP frameworks have been developed only for MIP, for example,COIN/BCP (IBM, 2003) andABACUS (OREAS GmbH, 1999). In order to generalize MIP-BCP to MINLP-BCP, the following points have to be taken into account: - A given (sparse) MINLP is reformulated as a block-separable program with linear coupling constraints.The block structure makes it possible to generate Lagrangian cuts and to apply Lagrangian heuristics. - In order to facilitate the generation of polyhedral relaxations, nonlinear c- vex relaxations are constructed.- The MINLP separation and pricing subproblems for generating cuts and columns are solved with specialized MINLP solvers. 213 pp. Englisch.
Published by Birkhäuser Basel, Birkhäuser Basel Aug 2005, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
US$ 128.25
Convert currencyQuantity: 1 available
Add to basketBuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Nonlinearoptimizationproblemscontainingbothcontinuousanddiscretevariables are called mixed integer nonlinear programs (MINLP). Such problems arise in many elds, such as process industry, engineering design, communications, and nance. There is currently a huge gap between MINLP and mixed integer linear programming(MIP) solvertechnology.With a modernstate-of-the-artMIP solver itispossibletosolvemodelswithmillionsofvariablesandconstraints,whereasthe dimensionofsolvableMINLPsisoftenlimitedbyanumberthatissmallerbythree or four orders of magnitude. It is theoretically possible to approximate a general MINLP by a MIP with arbitrary precision. However, good MIP approximations are usually much larger than the original problem. Moreover, the approximation of nonlinear functions by piecewise linear functions can be di cult and ti- consuming. In this book relaxation and decomposition methods for solving nonconvex structured MINLPs are proposed. In particular, a generic branch-cut-and-price (BCP) framework for MINLP is presented. BCP is the underlying concept in almost all modern MIP solvers. Providing a powerful decomposition framework for both sequential and parallel solvers, it made the success of the current MIP technology possible. So far generic BCP frameworks have been developed only for MIP, for example,COIN/BCP (IBM, 2003) andABACUS (OREAS GmbH, 1999). In order to generalize MIP-BCP to MINLP-BCP, the following points have to be taken into account: ¿ A given (sparse) MINLP is reformulated as a block-separable program with linear coupling constraints.The block structure makes it possible to generate Lagrangian cuts and to apply Lagrangian heuristics. ¿ In order to facilitate the generation of polyhedral relaxations, nonlinear c- vex relaxations are constructed.¿ The MINLP separation and pricing subproblems for generating cuts and columns are solved with specialized MINLP solvers.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 232 pp. Englisch.