On Exploiting Original Problem Data in the Inverse Representation of Linear Programming Bases

DOI10.1287/IJOC.6.2.193MaRDI QIDQ4302722zbMATH OpenOpenAlexFDO

Authors Jacek Gondzio

Publication date 21 August 1994

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.6.2.193

zbMATH Keywords

inverse of linear programming bases

Mathematics Subject Classification ID

Linear programming (90C05)

Cited in

(8)

• On the use of dense matrix techniques within sparse simplex
• Novel update techniques for the revised simplex method
• scientific article; zbMATH DE number 446512 (Why is no real title available?)
• scientific article; zbMATH DE number 3856811 (Why is no real title available?)
• scientific article; zbMATH DE number 4059114 (Why is no real title available?)
• scientific article; zbMATH DE number 176402 (Why is no real title available?)
• A new product form of the inverse
• Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage

This page was built for publication: On Exploiting Original Problem Data in the Inverse Representation of Linear Programming Bases

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