Accession Number : AD0114134


Title :   Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints


Descriptive Note : Research memo.


Corporate Author : RAND CORP SANTA MONICA CA


Personal Author(s) : Dantzig, George B ; Orden, Alex ; Wolfe, Philip


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/114134.pdf


Report Date : 05 Apr 1954


Pagination or Media Count : 25


Abstract : The determination of optimum solutions to systems of linear inequalities has assumed increasing importance as a tool for mathematical analysis of certain problems in economics, logistics, and the theory of games. This paper develops a theory for avoiding assumptions regarding rank of underlying matrices which has import in applications where little or nothing is known about the rank of some linear inequality system requiring solution.


Descriptors :   *MATRICES(MATHEMATICS) , *SCHEDULING , ECONOMICS , GAME THEORY , INEQUALITIES , LOGISTICS , MATHEMATICAL ANALYSIS


Subject Categories : Theoretical Mathematics


Distribution Statement : APPROVED FOR PUBLIC RELEASE