A convergence proof for linear mean value cross decomposition

DOI10.1007/BF01415580zbMath0799.90089MaRDI QIDQ4296293

Kaj Holmberg

Publication date: 17 November 1994

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

Lagrange multipliersBrown- Robinson methodKornai-Liptak methodmeans value cross decomposition method

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems ⋮ Efficient decomposition and linearization methods for the stochastic transportation problem ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem ⋮ Linear mean value cross decomposition: A generalization of the Kornai- Liptak method ⋮ Mean value cross decomposition applied to integer programming problems

Cites Work

• On the convergence of cross decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
• An iterative method of solving a game
• Decomposition Principle for Linear Programs
• Cross decomposition for mixed integer programming
• Two-Level Planning

This page was built for publication: A convergence proof for linear mean value cross decomposition