An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks

Abstract

The paper presents a one pass algorithm that determines an advanced dual basic feasible solution for a class of capacitated generalized network problems. Special cases in this class of problems include transportation and transshipment problems. Computational results are included which show that this new start substantially improves the solution performance of the dual method for transportation and transshipment problems. In fact, a dual code employing this advanced start is found to be faster (in terms of total solution time) than the fastest out-of-kilter code SEPERK on highly rectangular transportation problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1974
Accession Number
AD0779142

Entities

People

  • Darwin Dee Klingman
  • John Hultz
  • Robert Russell

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Commerce
  • Computations
  • Computer Programming
  • Flow Network
  • Iterations
  • Linear Programming
  • Military Research
  • New York
  • North Carolina
  • Operations Research
  • Simplex Method
  • Standards
  • Transportation
  • United States
  • United States Government
  • Universities

Readers

  • Operations Research