Equivalence of Boolean Constrained Transportation Problems to Transportation Problems

Abstract

The paper characterizes a class of constrained transportation problems (linear programming problems which are composed of a transportation problem with additional constraints) which can be transformed into equivalent transportation problems. An efficient computational procedure for finding an equivalent transportation problem is presented which introduces at most one origin and one destination for each extra constraint. The results extend the procedures developed by Wagner and Manne for problems in which the extra constraints consist of bounding certain partial sums of variables.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1972
Accession Number
AD0757986

Entities

People

  • Darwin Dee Klingman
  • Fred W. Glover
  • G. T. Ross

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Colorado
  • Commerce
  • Computer Programming
  • Containers
  • Contracts
  • Heuristic Methods
  • Inequalities
  • Integer Programming
  • Linear Programming
  • Military Research
  • Operations Research
  • Standards
  • Transportation
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research