AN EXTENSION OF GENERALIZED UPPER BOUNDED TECHNIQUES I FOR STRUCTURED LINEAR PROGRAMS

Abstract

An algorithm is developed for solving a special structured linear program. The particular structure studied has a large number of blocks coupled together by a relatively few connecting equations. The method proposed in an extension of 'Generalized Upper bounding Techniques for Linear Programming-I,' by G. B. Dantzig and R. M. Van Slyke (March 1965) and, from the basis, defines a working basis which is much smaller in size than the original. Two methods of updating the working basis are proposed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1965
Accession Number
AD0630861

Entities

People

  • M. Sakarovitch
  • R. Saigal

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • Biomedical

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Classification
  • Computational Complexity
  • Computations
  • Computer Programming
  • Contractors
  • Contracts
  • Equations
  • Governments
  • Heuristic Methods
  • Iterations
  • Linear Programming
  • Operations Research
  • Simplex Method
  • United States Government
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research