James L. Riggs, Lawrence L. Bethel, Franklin S. Atwater, George H. E. Smith, and Harvey A. Stackman, Jr., Industrial Organization and Management, McGraw-Hill, 1979

The transportation method is an example of a relatively direct manual approach to solving a linear programming problem. Assume there are four plants supplied from three warehouses. The amount required by each plant and the amount available in each warehouse are known. When the shipping costs between plants and warehouses are also known, the problem is directed to deciding the least cost program for transporting supplies. The compact solution format for these relationships is shown by the transportation matrix [at right].