Notes on Linear Programming—Part V

A Product-Form Tableau for Revised Simplex Method: Computing Appendix for RM-1268

George Bernard Dantzig, W. Orchard-Hays, G. Waters

ResearchPublished 1954

A computing appendix for RM-1268, Notes on Linear Programming--Part V: Alternate Algorithm for the Revised Simplex Method Using Product Form for the Inverse. The method considered is applied to a linear programming problem (requiring the minimization of a given functional subject to linear restraints) in order to illustrate the tableau. A description of a finite iterative procedure, using a product form for the inverse.

Topics

Document Details

Citation

Chicago Manual of Style

Dantzig, George Bernard, W. Orchard-Hays, and G. Waters, Notes on Linear Programming—Part V: A Product-Form Tableau for Revised Simplex Method: Computing Appendix for RM-1268. Santa Monica, CA: RAND Corporation, 1954. https://www.rand.org/pubs/research_memoranda/RM1268z1.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.