Decomposition in general mathematical programming

DOI10.1007/BF01580620zbMath0784.90107OpenAlexW2072677159MaRDI QIDQ689140

Alexander H. G. Rinnooy Kan, Olaf E. Flippo

Publication date: 9 December 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580620

zbMATH Keywords

asymptotic convergence resultsconstraint decompositionvariable decomposition

Mathematics Subject Classification ID

Mathematical programming (90C99)

Related Items

Petroleum supply planning: reformulations and a novel decomposition algorithm, The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming, Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint, Inexact solution of NLP subproblems in MINLP, A decomposition approach for solving a broadcast domination network design problem, The Benders Dual Decomposition Method, Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization, Decomposition-based inner- and outer-refinement algorithms for global optimization, Convex mixed integer nonlinear programming problems and an outer approximation algorithm, Problems related to estimating the coefficients of exact penalty functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of cross decomposition
• A note on Benders' decomposition in mixed-integer quadratic programming
• On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
• Partitioning procedures for solving mixed-variables programming problems
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
• Generalized Benders decomposition
• Decomposition Principle for Linear Programs
• A generalized Benders decomposition approach to reactive source planning in power systems
• On general decomposition schemes in mathematical programming
• Improved algorithm for mixed-integer quadratic programs and a computational study
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• A resource decomposition algorithm for general mathematical programs
• An elementary survey of general duality theory in mathematical programming
• Mixed-integer quadratic programming
• Generalized Linear Programming Solves the Dual
• Cross decomposition for mixed integer programming
• Two-Level Planning