scientific article; zbMATH DE number 3892925

MaRDI QIDQ5184663zbMATH OpenFDO

Authors A. V. Belobrodskij

Publication date 1980

zbMATH Keywords

decomposition method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Decomposition methods (49M27)

Recommendations

• On the decomposition of linear programming problems with connecting constraints and variables
• An efficient decomposition method for linear programming problems
• Dynamic decomposition method for linear programming problems with ceneralized upper bounds
• scientific article; zbMATH DE number 55953
• On the parallel use of the decomposition method in a pair of dual problems of linear programming

Cited in

(8)

• scientific article; zbMATH DE number 4023014 (Why is no real title available?)
• scientific article; zbMATH DE number 1513156 (Why is no real title available?)
• On the decomposition of linear programming problems with connecting constraints and variables
• scientific article; zbMATH DE number 3898614 (Why is no real title available?)
• Decomposition theorems for linear programs
• Méthodes de décomposition et décentralisation en programmation linéaire
• An efficient decomposition method for linear programming problems
• Dynamic decomposition method for linear programming problems with ceneralized upper bounds

This page was built for publication:

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