SIMPLEX METHOD AND THEORY. NOTES ON LINEAR PROGRAMMING AND EXTENSIONS - PART 62

Abstract

The simplex method of linear programming is discussed in a format designed to exhibit overall structure rather than specific operational details. Various terminal possibilities reprepresented schematically and geometrically, and it is shown that transposition duality theorems can be regarded as corollaries of the duality theorem for a homogeneous linear program.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1962
Accession Number
AD0277519

Entities

People

  • A. W. Tucker

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computations
  • Computer Programming
  • Convex Sets
  • Equations
  • Government Procurement
  • Inequalities
  • Linear Programming
  • Linear Systems
  • Mathematical Programming
  • Mathematics
  • Military Research
  • Operations Research
  • Quadratic Programming
  • Simplex Method
  • United States

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Theoretical Analysis.