Technical Note—Generalized Upper Bounds and Triangular Decomposition in the Simplex Method

DOI10.1287/OPRE.22.3.664zbMATH Open0281.90043OpenAlexW1973035862MaRDI QIDQ4766795FDOQ4766795

Authors:

Publication date: 1974

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.22.3.664

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (1)

• Large-scale linear programming: Geometry, working bases and factorizations

This page was built for publication: Technical Note—Generalized Upper Bounds and Triangular Decomposition in the Simplex Method

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