THE DECOMPOSITION ALGORITHM FOR LINEAR PROGRAMMING. NOTES ON LINEAR PROGRAMMING AND EXTENSIONS. PART 57

Abstract

A procedure is presented for the efficient computational solution of linear programs having a certain structural property characteristic of a large class of problems of practical interest. This property makes possible the decomposition of the problem into a sequence of small linear programs whose iterate solutions solve the given problem through a generalization of the simple method for linear programming.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1961
Accession Number
AD0263628

Entities

People

  • George Bernard Dantzig
  • Philip Wolfe

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

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

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Computer Science.