Solving Transportation Problems via Aggregation,

Abstract

This paper deals with the solution of large scale transportation problems by aggregation as a special case of constraint and variable aggregation in linear programming. Using cluster analysis, an appropriate form of aggregation will be used. If the bounds developed at this point are not tight enough, a suitable unaggregation step will be specified. Computational results are presented. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1984
Accession Number
ADA144219

Entities

People

  • C. M. Shetty
  • R. W. Taylor

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • C4I
  • Cyber

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Business Administration
  • Computations
  • Computer Programming
  • Computers
  • Engineering
  • Errors
  • Experimental Design
  • Industrial Engineering
  • Iterations
  • Linear Programming
  • Machine Languages
  • Military Research
  • Operating Systems
  • Systems Engineering
  • Transportation

Readers

  • Operations Research