Generalized Upper Bounds and Triangular Decomposition in the Simplex Method

Abstract

Two recent advances in linear programming have been the very successful implementation of the Generalized Upper Bound (GUB) algorithm, due to Dantzig and Van Slyke and the new methods for updating triangular factors of the basis in the Simplex Method (Bartels, Forrest and Tomlin). The purpose of the note is to show that despite the special basis inverse manipulation involved in one step of the GUB algorithm these two techniques can be successfully combined.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1972
Accession Number
AD0750676

Entities

People

  • John A. Tomlin

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Programming
  • Contracts
  • Decomposition
  • Governments
  • Heuristic Methods
  • Instructions
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Operations Research
  • Security
  • Simplex Method
  • United States
  • United States Government

Fields of Study

  • Mathematics

Readers

  • Operations Research