Determining GUB sets via an invert agenda algorithm

DOI10.1007/BF01585520zbMath0295.90027OpenAlexW1963499005MaRDI QIDQ4048848

Harvey J. Greenberg, Dennis C. Rarick

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (5)

Dynamic factorization in large-scale optimization ⋮ Automatic identification of embedded network rows in large-scale optimization models ⋮ Detecting embedded pure network structures in LP problems ⋮ The practical conversion of linear programmes to network flow models ⋮ Identification of special structure constraints in linear programs

Cites Work

• The Elimination form of the Inverse and its Application to Linear Programming
• Evolution of Linear Programming Computing Techniques
• Reinversion with the preassigned pivot procedure

This page was built for publication: Determining GUB sets via an invert agenda algorithm