Determining GUB sets via an invert agenda algorithm

DOI10.1007/BF01585520MaRDI QIDQ4048848zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Evolution of linear programming computing techniques
• Reinversion with the preassigned pivot procedure
• The elimination form of the inverse and its application to linear programming

Cited in

(5)

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

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

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