The Cross-Section Method

An Algorithm for Linear Programming

Janet Stone

Expert InsightsPublished 1958

An algorithm that solves the linear-programming problem. This algorithm combines the usual phase one (obtaining feasibility) and phase two (obtaining optimality) of the simplex or dual methods into a single phase. The algorithm begins with either a single activity (column) or a constraint (equation) and proceeds to add either activities or constraints one at a time, solving the subproblems that arise for their optimal solutions. The final solution is attained after adding the last activity or constraint. The algorithm promises to be an efficient one and has several advantages arising from the information supplied about subproblems.

Topics

Document Details

Citation

Chicago Manual of Style

Stone, Janet, The Cross-Section Method: An Algorithm for Linear Programming. Santa Monica, CA: RAND Corporation, 1958. https://www.rand.org/pubs/papers/P1490.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.