THE CROSS-SECTION METHOD, AN ALGORITHM FOR LINEAR PROGRAMMING

Abstract

In this paper an algorithm is presented which solves the linear programming problem. This algorithm combines the usual phase one (getting feasibility) and phase two (getting 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 which 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 which arise from the information supplied about subproblems. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 16, 1958
Accession Number
AD0607025

Entities

People

  • Jeremy J. Stone

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Corporations
  • Equations
  • Hard Copy
  • Heuristic Methods
  • Inequalities
  • Iterations
  • Linear Programming
  • Optimization
  • Production
  • Reasoning
  • Simplex Method

Readers

  • Operations Research