AN ALOGRITHM FOR THE GENERALIZATION TRANSPORTATION PROBLEM

This paper describes a new computational techniques for solving spatial economic equilibrium problems which are generalizations of the classic transportation problem. This technique makes use of a type of algorithm which has been developed in recent years to compute Kakutani fixed points and solve related problems. Existing algorithms for the generalized transportation problem employ quadratic programming, and therefore require that demand and supply functions be linear. By contrast, the algorithm of this paper can handle demand and supply relationships which are nonlinear or even semi-continuous. It can also handle non-constant transport costs and various other complications. The technique is capable of yielding highly accurate solutions, and appears to be computationally efficient on problems of reasonable size.

  • Availability:
  • Corporate Authors:

    North-Holland Publishing Company

    P.O. Box 211
    1000 AE Amsterdam,   Netherlands 
  • Authors:
    • MacKinnor, J G
  • Publication Date: 1975-12

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00133968
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 23 1976 12:00AM