scientific article; zbMATH DE number 3892925

zbMATH Open0559.90049MaRDI QIDQ5184663FDOQ5184663

Authors: A. V. Belobrodskij 

Publication date: 1980

Title of this publication is not available (Why is that?)

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
• On the parallel use of the decomposition method in a pair of dual problems of linear programming

zbMATH Keywords

decomposition method

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the decomposition of linear programming problems with connecting constraints and variables
• Title not available (Why is that?)
• 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)