On the convergence of cross decomposition

DOI10.1007/BF01580863zbMATH Open0715.90078OpenAlexW2060208495MaRDI QIDQ752000FDOQ752000

Authors: Kaj Holmberg 

Publication date: 1990

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

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

Recommendations

• scientific article; zbMATH DE number 2154248
• scientific article; zbMATH DE number 176467
• Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
• A convergence proof for linear mean value cross decomposition
• Mean value cross decomposition for nonlinear convex problems

zbMATH Keywords

generalized Benders decompositionCross decompositionstronger convergence tests

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Generalized Benders decomposition
• Decomposition Principle for Linear Programs
• Cross decomposition applied to the stochastic transportation problem
• Cross decomposition for mixed integer programming
• A Cross Decomposition Algorithm for Capacitated Facility Location
• On general decomposition schemes in mathematical programming
• A growth property in concave-convex Hamiltonian systems

Cited In (26)

• On foundations of the Hardy Cross method
• Decomposition in general mathematical programming
• A convergence proof for linear mean value cross decomposition
• The Benders decomposition algorithm: a literature review
• A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
• Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
• Constraint partitioning in penalty formulations for solving temporal planning problems
• Title not available (Why is that?)
• Cross decomposition applied to the stochastic transportation problem
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
• Mean value cross decomposition applied to integer programming problems
• Location and layout planning. A survey
• Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
• Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
• A new cross decomposition method for stochastic mixed-integer linear programming
• The Benders dual decomposition method
• Multiperiod optimal planning of thermal generation using cross decomposition
• Title not available (Why is that?)
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem
• Title not available (Why is that?)
• Mean value cross decomposition for nonlinear convex problems
• On using approximations of the Benders master problem
• A hybrid approach of bundle and Benders applied large mixed linear integer problem
• On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
• Title not available (Why is that?)

This page was built for publication: On the convergence of cross decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752000)