Imagen de Google Jackets

Nonlinear Integer Programming [electronic resource] / by Duan Li, Xiaoling Sun.

Por: Colaborador(es): Tipo de material: TextoTextoSeries International Series in Operations Research & Management Science ; 84 | International Series in Operations Research & Management Science ; 84Editor: Boston, MA : Springer US, 2006Descripción: XXII, 438 p. online resourceTipo de contenido:
  • text
Tipo de medio:
  • computer
Tipo de soporte:
  • online resource
ISBN:
  • 9780387329956
Trabajos contenidos:
  • SpringerLink (Online service)
Tema(s): Formatos físicos adicionales: Sin títuloClasificación CDD:
  • 519.6 23
Clasificación LoC:
  • QA402.5-402.6
Recursos en línea:
Contenidos:
Springer eBooksResumen: It is not an exaggeration that much of what people devote in their hfe reá solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programming has been one of the great challenges for the optimization research community for many years, due to its computational difficulties: Exponential growth in its computational complexity with respect to the problem dimension. Since the pioneering work of R. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. The past few years have also witnessed certain promising theoretical and methodological achieveá ments in nonlinear integer programming. When the first author of this book was working on duality theory for n- convex continuous optimization in the middle of 1990s, Prof. Douglas J. White suggested that he explore an extension of his research results to integer proá gramming. The two authors of the book started their collaborative work on integer programming and global optimization in 1997. The more they have investigated in nonlinear integer programming, the more they need to further delve into the subject. Both authors have been greatly enjoying working in this exciting and challenging field.
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

Optimality, Relaxation and General Solution Procedures -- Lagrangian Duality Theory -- Surrogate Duality Theory -- Nonlinear Lagrangian and Strong Duality -- Nonlinear Knapsack Problems -- Separable Integer Programming -- Nonlinear Integer Programming with a Quadratic Objective Function -- Nonseparable Integer Programming -- Unconstrained Polynomial 01 Optimization -- Constrained Polynomial 01 Programming -- Two Level Methods for Constrained Polynomial 01 Programming -- Mixed-Integer Nonlinear Programming -- Global Descent Methods.

It is not an exaggeration that much of what people devote in their hfe reá solves around optimization in one way or another. On one hand, many decision making problems in real applications naturally result in optimization problems in a form of integer programming. On the other hand, integer programming has been one of the great challenges for the optimization research community for many years, due to its computational difficulties: Exponential growth in its computational complexity with respect to the problem dimension. Since the pioneering work of R. Gomory [80] in the late 1950s, the theoretical and methodological development of integer programming has grown by leaps and bounds, mainly focusing on linear integer programming. The past few years have also witnessed certain promising theoretical and methodological achieveá ments in nonlinear integer programming. When the first author of this book was working on duality theory for n- convex continuous optimization in the middle of 1990s, Prof. Douglas J. White suggested that he explore an extension of his research results to integer proá gramming. The two authors of the book started their collaborative work on integer programming and global optimization in 1997. The more they have investigated in nonlinear integer programming, the more they need to further delve into the subject. Both authors have been greatly enjoying working in this exciting and challenging field.

ZDB-2-SMA

No hay comentarios en este titulo.

para colocar un comentario.