DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
AD0607025
Title:
THE CROSS-SECTION METHOD, AN ALGORITHM FOR LINEAR PROGRAMMING
Corporate Author:
RAND CORP SANTA MONICA CA
Report Date:
1958-09-16
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
Pages:
0025
Distribution Statement:
Approved for public release; distribution is unlimited.
File Size:
1.91MB
