Dynamic decomposition method for linear programming problems with ceneralized upper bounds

DOI10.1007/BF01075076MaRDI QIDQ3777793zbMATH OpenFDO

Authors V. A. Trubin

Publication date 1986

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

decomposition methodupper bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Decomposition methods (49M27)

Recommendations

• scientific article; zbMATH DE number 3892925
• scientific article; zbMATH DE number 1069803
• On the decomposition of linear programming problems with connecting constraints and variables
• An efficient decomposition method for linear programming problems
• Local decomposition methods for linear programming

Cites work

• scientific article; zbMATH DE number 3864992 (Why is no real title available?)
• Blocking and Antiblocking Polyhedra
• Blocking and anti-blocking pairs of polyhedra
• Blocking pairs of polyhedra arising from network flows

Cited in

(6)

• Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
• Main directions in the development of informatics
• Some directions and results of research in mathematical programming and system analysis
• A fast method for a class of one-stage bounded variables and single constrained linear programming problems
• scientific article; zbMATH DE number 3892925 (Why is no real title available?)
• scientific article; zbMATH DE number 3902400 (Why is no real title available?)

Describes a project that uses

Uses Software

• DISPRO

This page was built for publication: Dynamic decomposition method for linear programming problems with ceneralized upper bounds

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