COMMENT ON GENERALIZED UPPER BOUNDED TECHNIQUES IN LINEAR PROGRAMMING

Abstract

Dantzig and Van Slyke (AD-610 950) have proved a theorem that gives an upper bound on the number of sets containing at least two basic variables. This fact is exploited to develop an algorithm that is computationally efficient for a large scale system with a special structure. It is possible to show that this bound can be improve. The significance of this improvement lies in the fact that since it is related to the order of the working basis, the computation can be carried out with a basis of order less by one than that considered in the above. The purpose of this note is to describe it and illustrate by an example.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1965
Accession Number
AD0621550

Entities

People

  • R. N. Kaul

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Computations
  • Computer Programming
  • Contracts
  • Engineering
  • Equations
  • Linear Programming
  • Military Research
  • Operations Research
  • United States
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Theoretical Analysis.