Simplex Method and Theory: Notes on Linear Programming and Extensions--Part 62.

A. W. Tucker

ResearchPublished 1962

A discussion of the simplex method of linear programming in a format designed to exhibit over-all structure rather than specific operational details. Various terminal possibilities are represented schematically and geometrically. It is shown that transportation duality theorems can be viewed as corollaries of the duality theorem for a homogeneous linear program

Topics

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1962
  • Pages: 43
  • Document Number: RM-3199-PR

Citation

Chicago Manual of Style

Tucker, A. W., Simplex Method and Theory: Notes on Linear Programming and Extensions--Part 62. Santa Monica, CA: RAND Corporation, 1962. https://www.rand.org/pubs/research_memoranda/RM3199.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.