Dynamic decomposition method for linear programming problems with ceneralized upper bounds

DOI10.1007/BF01075076zbMath0636.90055MaRDI QIDQ3777793

V. A. Trubin

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

upper boundsdecomposition method

Mathematics Subject Classification ID

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

Related Items (3)

Some directions and results of research in mathematical programming and system analysis ⋮ Main directions in the development of informatics ⋮ Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)

Uses Software

• DISPRO

Cites Work

• Blocking pairs of polyhedra arising from network flows
• Blocking and Antiblocking Polyhedra
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item

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