Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
Nowak, Ivo
ISBN 10: 3764372389 ISBN 13: 9783764372385
Editorial: Birkhauser Verlag AG, 2005
Nuevos
Encuadernación de tapa blanda
Librería:
Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 27 de febrero de 2001
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
Presents a comprehensive description of theory, algorithms and software for solving nonconvex mixed integer nonlinear programs (MINLP). This book focuses on deterministic global optimization methods, which play a very important role in integer linear programming. It describes basic optimization tools and algorithms. Series: International Series of Numerical Mathematics. Num Pages: 229 pages, 29 black & white tables, biography. BIC Classification: PB. Category: (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 234 x 156 x 14. Weight in Grams: 504. . 2005. Hardback. . . . . N° de ref. del artículo V9783764372385
Sinopsis:
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.
De la contraportada:
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Relaxation and Decomposition Methods for ...
Editorial: Birkhauser Verlag AG
Año de publicación: 2005
Encuadernación: Encuadernación de tapa blanda
Condición: New
Los mejores resultados en AbeBooks
Imagen de archivo
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (International Series of Numerical Mathematics, 152)
Publicado por
Birkhäuser, 2005
ISBN 10: 3764372389
ISBN 13: 9783764372385
Antiguo o usado
Tapa dura
Librería: Bookmonger.Ltd, HILLSIDE, NJ, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
hardcover. Condición: Very Good. Crease on cover*. Nº de ref. del artículo: mon0000665231
Comprar usado
EUR 82,53
Gastos de envío:
EUR 3,45
A Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
Impresión bajo demandaLibrería: moluna, Greven, Alemania
Calificación del vendedor: 4 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 5279639
Comprar nuevo
EUR 92,27
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming | Ivo Nowak | Buch | xvi | Englisch | 2005 | Birkhäuser Basel | EAN 9783764372385 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 102423755
Comprar nuevo
EUR 95,80
Gastos de envío:
EUR 70,00
De Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen de archivo
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (International Series of Numerical Mathematics, 152)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Apr0316110059128
Comprar nuevo
EUR 103,47
Gastos de envío:
EUR 3,44
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Relaxation And Decomposition Methods for Mixed Integer Nonlinear Programming
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 3505224-n
Comprar nuevo
EUR 104,67
Gastos de envío:
EUR 2,28
A Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
Publicado por
Birkhäuser Basel, Birkhäuser Basel Aug 2005, 2005
ISBN 10: 3764372389
ISBN 13: 9783764372385
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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. Nº de ref. del artículo: 9783764372385
Comprar nuevo
EUR 106,99
Gastos de envío:
EUR 60,00
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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. Nº de ref. del artículo: 9783764372385
Comprar nuevo
EUR 106,99
Gastos de envío:
EUR 62,59
De Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen de archivo
Relaxation And Decomposition Methods for Mixed Integer Nonlinear Programming
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: 3505224-n
Comprar nuevo
EUR 114,11
Gastos de envío:
EUR 17,02
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming (International Series of Numerical Mathematics, 152)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783764372385_new
Comprar nuevo
EUR 114,12
Gastos de envío:
EUR 13,60
De Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 232. Nº de ref. del artículo: 26304558
Comprar nuevo
EUR 141,49
Gastos de envío:
EUR 3,44
A Estados Unidos de America
Cantidad disponible: 4 disponibles