Deals with the problem of optimizing wagon hours on a railways division with and without constraints on route capacities. Both the linear programming techniques, namely, the Transportation and the Simplex methods have been discussed with the aid of simple numerical examples bringing out their basic differences as well as the scope of their application. It has been taken for granted that the readers are aware of the iterative procedures involved in the two methods.

  • Corporate Authors:

    International Railway Congress Association

    17-21 rue de Louvrain
    1000 Brussels,   Belgium 
  • Authors:
    • Misra, S C
  • Publication Date: 1972-3

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00046754
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Oct 18 1974 12:00AM