GENERALIZED UPPER BOUNDED TECHNIQUES FOR LINEAR PROGRAMMING - I

Abstract

A variant of the simplex method is given for solving linear programs with M + L equations, L of which have the property that each variable has at most one nonzero coefficient. Special cases include transportation problems, programs with upper bounded variables, assignment and weighted distribution problems. The main feature of the algorithm is that a working basis of order 2M + 1 is utilized for pivoting, pricing, and inversion which for large L can be of significantly lower order than that of the original system.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 05, 1964
Accession Number
AD0610950

Entities

People

  • George Bernard Dantzig
  • Richard M. Van Slyke

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computer Programming
  • Engineering
  • Equations
  • Heuristic Methods
  • Iterations
  • Linear Programming
  • Military Research
  • Operations Research
  • Simplex Method
  • Transportation
  • Vans

Fields of Study

  • Mathematics

Readers

  • Operations Research