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

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 05, 1954
Accession Number
AD0114134

Entities

People

  • Alex Orden
  • George Bernard Dantzig
  • Philip Wolfe

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computations
  • Computer Programming
  • Equations
  • Game Theory
  • Inequalities
  • Linear Programming
  • Mathematical Analysis
  • Numbers
  • Real Numbers
  • Real Variables
  • Simplex Method
  • Theorems
  • United States

Fields of Study

  • Mathematics

Readers

  • Operations Research