The Stochastic Generalized Transportation Problem -- An Operator Theoretic Approach.

Abstract

The paper investigates the Stochastic Generalized Transportation Problem with recourse when the demands (column totals) are random. The basic philosophy and assumptions are those of the two-stage linear programming under uncertainty. It is shown that the problem can be converted to an equivalent convex program where the random components are explicitly addressed in the functional thus retaining the dimensionality of the constraints unchanged. Utilizing Kuhn-Tucker conditions certain qualitative propositions and theorems are proved. These results lead to an efficient computer code which proceeds in an iterative process solving once the deterministic generalized transportation problem. (Modified author abstract)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1973
Accession Number
AD0761070

Entities

People

  • V. Balachandran

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Computer Programming
  • Computers
  • Linear Programming
  • Philosophy
  • Transportation
  • Uncertainty

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Systems Analysis and Design