2001 | OriginalPaper | Buchkapitel
On Cross Decomposition for Mixed-Integer Programming
verfasst von : Paul Wentges
Erschienen in: Models, Methods and Decision Support for Management
Verlag: Physica-Verlag HD
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Primal and dual decomposition procedures can lead – dependent on the structure of the problem – to efficient procedures for solving mixed—integer programming problems. Benders’ decomposition takes advantage of the primal structure of a problem by temporarily fixing the aggravating integer variables, while dual structures can be exploited by relaxing the complicating constraints in Lagrangian fashion and solving the Lagrangian dual with subgradient optimization, multiplier adjustment methods, or Dantzig-Wolfe decomposition.