Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming

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...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Main Author: Nowak, Ivo (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:Inglés
Published: Basel : Birkhäuser Basel : Imprint: Birkhäuser, 2005.
Edition:1st ed. 2005.
Series:International Series of Numerical Mathematics, 152
Subjects:
Computer science-Mathematics.
Mathematics.
Algorithms.
Mathematics-Data processing.
Computer programming.
Mathematical Applications in Computer Science.
Applications of Mathematics.
Computational Science and Engineering.
Programming Techniques.
Online Access:Texto Completo
Table of Contents:
  • Basic Concepts
  • Problem Formulations
  • Convex and Lagrangian Relaxations
  • Decomposition Methods
  • Semidefinite Relaxations
  • Convex Underestimators
  • Cuts, Lower Bounds and Box Reduction
  • Local and Global Optimality Criteria
  • Adaptive Discretization of Infinite Dimensional MINLPs
  • Algorithms
  • Overview of Global Optimization Methods
  • Deformation Heuristics
  • Rounding, Partitioning and Lagrangian Heuristics
  • Branch-Cut-and-Price Algorithms
  • LaGO - An Object-Oriented Library for Solving MINLPs.

Similar Items