Inductive proof of the simplex method.

George Bernard Dantzig

Expert InsightsPublished 1960

A proof of the existence of an optimal basis in the simplex method based on induction. Specifically, it is shown that a finite chain of feasible basis changes exists, resulting in either an optimal feasible solution or in an infinite class of feasible solutions, such that the objective form tends to minus infinity.

Document Details

Citation

Chicago Manual of Style

Dantzig, George Bernard, Inductive proof of the simplex method. Santa Monica, CA: RAND Corporation, 1960. https://www.rand.org/pubs/papers/P1851.html.
BibTeX RIS

This publication is part of the RAND paper series. The paper series was a product of RAND from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

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.