Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (International Series of Numerical Mathematics)
7 Angebote vergleichen
Preise | 2013 | 2014 | 2015 | 2017 | 2021 |
---|---|---|---|---|---|
Schnitt | € 129,78 | € 135,01 | € 183,75 | € 127,97 | € 139,05 |
Nachfrage |
1
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
DE HC NW
ISBN: 9783764372385 bzw. 3764372389, in Deutsch, Birkhäuser, gebundenes Buch, neu.
Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
This book presents a comprehensive description of efficient methods for solving nonconvex mixed integer nonlinear programs, including several numerical and theoretical results, which are presented here for the first time. It contains many illustrations and an up-to-date bibliography. Because on the emphasis on practical methods, as well as the introduction into the basic theory, the book is accessible to a wide audience. It can be used both as a research and as a graduate text.2005. xvi, 213 S. 29 Tabellen,Versandfertig in 3-5 Tagen, Hardcover.
buecher.de GmbH & Co. KG, [1].
This book presents a comprehensive description of efficient methods for solving nonconvex mixed integer nonlinear programs, including several numerical and theoretical results, which are presented here for the first time. It contains many illustrations and an up-to-date bibliography. Because on the emphasis on practical methods, as well as the introduction into the basic theory, the book is accessible to a wide audience. It can be used both as a research and as a graduate text.2005. xvi, 213 S. 29 Tabellen,Versandfertig in 3-5 Tagen, Hardcover.
2
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
DE HC NW
ISBN: 9783764372385 bzw. 3764372389, in Deutsch, Birkhauser, gebundenes Buch, neu.
Von Händler/Antiquariat, BuySomeBooks [52360437], Las Vegas, NV, U.S.A.
Hardcover. 229 pages. This book presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). The main focus is on deterministic global optimization methods, which play a very important role in integer linear programming, and are used only recently in MINLP. The presented material consists of two parts. The first part describes basic optimization tools, such as block-separable reformulations, convex and Lagrangian relaxations, decomposition methods and global optimality criteria. Some of these results are presented here for the first time. The second part is devoted to algorithms. Starting with a short overview on existing methods, deformation, rounding, partitioning and Lagrangian heuristics, and a branch-cut-and-price algorithm are presented. The algorithms are implemented as part of an object-oriented library, called LaGO. Numerical results on several mixed integer nonlinear programs are reported to show abilities and limits of the proposed solution methods. The book contains many illustrations and an up-to-date bibliography. Because of the emphasis on practical methods, as well as the introduction into the basic theory, it is accessible to a wide audience and can be used both as a research as well as a graduate text. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN.
Hardcover. 229 pages. This book presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). The main focus is on deterministic global optimization methods, which play a very important role in integer linear programming, and are used only recently in MINLP. The presented material consists of two parts. The first part describes basic optimization tools, such as block-separable reformulations, convex and Lagrangian relaxations, decomposition methods and global optimality criteria. Some of these results are presented here for the first time. The second part is devoted to algorithms. Starting with a short overview on existing methods, deformation, rounding, partitioning and Lagrangian heuristics, and a branch-cut-and-price algorithm are presented. The algorithms are implemented as part of an object-oriented library, called LaGO. Numerical results on several mixed integer nonlinear programs are reported to show abilities and limits of the proposed solution methods. The book contains many illustrations and an up-to-date bibliography. Because of the emphasis on practical methods, as well as the introduction into the basic theory, it is accessible to a wide audience and can be used both as a research as well as a graduate text. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN.
3
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (2005)
DE NW RP
ISBN: 9783764372385 bzw. 3764372389, in Deutsch, Birkhäuser Aug 2005, neu, Nachdruck.
Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, NDS, Germany.
This item is printed on demand - Print on Demand Titel. - This book presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). The main focus is on deterministic global optimization methods, which play a very important role in integer linear programming, and are used only recently in MINLP.The presented material consists of two parts. The first part describes basic optimization tools, such as block-separable reformulations, convex and Lagrangian relaxations, decomposition methods and global optimality criteria. Some of these results are presented here for the first time.The second part is devoted to algorithms. Starting with a short overview on existing methods, deformation, rounding, partitioning and Lagrangian heuristics, and a branch-cut-and-price algorithm are presented. The algorithms are implemented as part of an object-oriented library, called LaGO. Numerical results on several mixed integer nonlinear programs are reported to show abilities and limits of the proposed solution methods.The book contains many illustrations and an up-to-date bibliography. Because of the emphasis on practical methods, as well as the introduction into the basic theory, it is accessible to a wide audience and can be used both as a research as well as a graduate text. 232 pp. Englisch.
This item is printed on demand - Print on Demand Titel. - This book presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). The main focus is on deterministic global optimization methods, which play a very important role in integer linear programming, and are used only recently in MINLP.The presented material consists of two parts. The first part describes basic optimization tools, such as block-separable reformulations, convex and Lagrangian relaxations, decomposition methods and global optimality criteria. Some of these results are presented here for the first time.The second part is devoted to algorithms. Starting with a short overview on existing methods, deformation, rounding, partitioning and Lagrangian heuristics, and a branch-cut-and-price algorithm are presented. The algorithms are implemented as part of an object-oriented library, called LaGO. Numerical results on several mixed integer nonlinear programs are reported to show abilities and limits of the proposed solution methods.The book contains many illustrations and an up-to-date bibliography. Because of the emphasis on practical methods, as well as the introduction into the basic theory, it is accessible to a wide audience and can be used both as a research as well as a graduate text. 232 pp. Englisch.
4
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (2014)
DE HC NW
ISBN: 9783764372385 bzw. 3764372389, in Deutsch, SPRINGER VERLAG GMBH 01/02/2014, gebundenes Buch, neu.
Von Händler/Antiquariat, Paperbackshop-US [8408184], Secaucus, NJ, U.S.A.
New Book. This item is printed on demand. Shipped from US This item is printed on demand.
New Book. This item is printed on demand. Shipped from US This item is printed on demand.
5
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (2003)
~EN HC NW
ISBN: 9783764372385 bzw. 3764372389, vermutlich in Englisch, Springer Nature, gebundenes Buch, neu.
Lieferung aus: Deutschland, Lagernd, zzgl. Versandkosten.
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. Hard cover.
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. Hard cover.
6
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (2003)
~EN HC NW
ISBN: 9783764372385 bzw. 3764372389, vermutlich in Englisch, Springer Shop, gebundenes Buch, neu.
Lieferung aus: Deutschland, Lagernd.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
7
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
DE HC NW
ISBN: 9783764372385 bzw. 3764372389, in Deutsch, Birkhauser Basel, gebundenes Buch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, En Stock, frais de port.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Lade…