Artículos relacionados a Relaxation and Decomposition Methods for Mixed Integer...

Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming: 152 (International Series of Numerical Mathematics) - Tapa dura

 
9783764372385: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming: 152 (International Series of Numerical Mathematics)

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

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.

  • EditorialBirkhäuser
  • Año de publicación2005
  • ISBN 10 3764372389
  • ISBN 13 9783764372385
  • EncuadernaciónTapa dura
  • IdiomaInglés
  • Número de páginas232
  • Contacto del fabricanteno disponible

Comprar usado

Condición: Bien
Crease on cover*
Ver este artículo

EUR 15,21 gastos de envío desde Estados Unidos de America a España

Destinos, gastos y plazos de envío

Comprar nuevo

Ver este artículo

EUR 19,49 gastos de envío desde Alemania a España

Destinos, gastos y plazos de envío

Otras ediciones populares con el mismo título

9780817672386: Dynamics On and Of Complex Networks

Edición Destacada

ISBN 10:  0817672389 ISBN 13:  9780817672386
Editorial: Springer, 2008
Tapa blanda

Resultados de la búsqueda para Relaxation and Decomposition Methods for Mixed Integer...

Imagen de archivo

Nowak, Ivo
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 Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

hardcover. Condición: Very Good. Crease on cover*. Nº de ref. del artículo: mon0000665231

Contactar al vendedor

Comprar usado

EUR 82,51
Convertir moneda
Gastos de envío: EUR 15,21
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen del vendedor

Ivo Nowak
Publicado por Birkhäuser Basel, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura
Impresión bajo demanda

Librería: moluna, Greven, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

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

Contactar al vendedor

Comprar nuevo

EUR 92,27
Convertir moneda
Gastos de envío: EUR 19,49
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Ivo Nowak
Publicado por Birkhäuser Basel, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

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

Contactar al vendedor

Comprar nuevo

EUR 106,99
Convertir moneda
Gastos de envío: EUR 11,99
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen de archivo

Nowak, Ivo
Publicado por Birkhäuser, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. In. Nº de ref. del artículo: ria9783764372385_new

Contactar al vendedor

Comprar nuevo

EUR 118,53
Convertir moneda
Gastos de envío: EUR 4,69
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: Más de 20 disponibles

Añadir al carrito

Imagen del vendedor

Ivo Nowak
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura
Impresión bajo demanda

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

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

Contactar al vendedor

Comprar nuevo

EUR 106,99
Convertir moneda
Gastos de envío: EUR 35,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 1 disponibles

Añadir al carrito

Imagen del vendedor

Ivo Nowak
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura
Impresión bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Buch. Condición: 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. Nº de ref. del artículo: 9783764372385

Contactar al vendedor

Comprar nuevo

EUR 139,05
Convertir moneda
Gastos de envío: EUR 11,00
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Imagen de archivo

Ivo Nowak
Publicado por Springer, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura

Librería: Books Puddle, New York, NY, Estados Unidos de America

Calificación del vendedor: 4 de 5 estrellas Valoración 4 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. pp. 232. Nº de ref. del artículo: 26304558

Contactar al vendedor

Comprar nuevo

EUR 140,09
Convertir moneda
Gastos de envío: EUR 9,99
De Estados Unidos de America a España
Destinos, gastos y plazos de envío

Cantidad disponible: 4 disponibles

Añadir al carrito

Imagen de archivo

Nowak Ivo
Publicado por Springer, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura
Impresión bajo demanda

Librería: Majestic Books, Hounslow, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: 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. Nº de ref. del artículo: 7543409

Contactar al vendedor

Comprar nuevo

EUR 142,90
Convertir moneda
Gastos de envío: EUR 10,43
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: 4 disponibles

Añadir al carrito

Imagen de archivo

Nowak Ivo
Publicado por Springer, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura
Impresión bajo demanda

Librería: Biblios, Frankfurt am main, HESSE, Alemania

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Condición: New. PRINT ON DEMAND pp. 232. Nº de ref. del artículo: 18304548

Contactar al vendedor

Comprar nuevo

EUR 148,71
Convertir moneda
Gastos de envío: EUR 14,50
De Alemania a España
Destinos, gastos y plazos de envío

Cantidad disponible: 4 disponibles

Añadir al carrito

Imagen de archivo

Nowak, Ivo/ Karl-Heintz Hoffman, Bonn (Editor)/ Mittelmann, Tempe D. (Editor)
Publicado por Birkhauser, 2005
ISBN 10: 3764372389 ISBN 13: 9783764372385
Nuevo Tapa dura

Librería: Revaluation Books, Exeter, Reino Unido

Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Hardcover. Condición: Brand New. 1st edition. 213 pages. 9.25x6.50x0.75 inches. In Stock. Nº de ref. del artículo: x-3764372389

Contactar al vendedor

Comprar nuevo

EUR 155,53
Convertir moneda
Gastos de envío: EUR 11,79
De Reino Unido a España
Destinos, gastos y plazos de envío

Cantidad disponible: 2 disponibles

Añadir al carrito

Existen otras 2 copia(s) de este libro

Ver todos los resultados de su búsqueda