CampusLearn
← BCM 321 Quantitative Techniques

Transportation Models and Initial Feasible Solutions

Notes

Overview of Transportation Models The transportation problem is a specialized category of linear programming designed to establish the most cost-effective schedule for distributing goods from multiple origins to multiple destinations. Origins possess limited available supplies, while destinations present fixed product demands. The ultimate objective is to minimize total distribution expenses while strictly adhering to both capacity limits and demand requirements. Mathematical Formulation and Balance A transportation problem is defined as balanced when total supply across all origins equals total demand across all destinations. When total supply and total demand differ, an unbalanced condition occurs. To resolve this imbalance before computation, a dummy origin or dummy destination with zero transportation unit costs is introduced to absorb the discrepancy. Methods for Initial Basic Feasible Solution Before testing for optimality, an analyst must generate an initial basic feasible solution satisfying supply and demand. Three standard algorithms are used. The North-West Corner Rule starts at the top-left cell and allocates quantities systematically without considering costs. The Least Cost Method prioritizes cells with the lowest unit transportation costs to seek early cost economies. Vogel's Approximation Method calculates penalty costs for not allocating to the best cell and generally yields an initial solution nearest to optimal. Optimality Testing and Degeneracy A basic feasible solution must contain exactly m plus n minus 1 occupied cells, where m is origins and n is destinations. If fewer cells are occupied, the solution is degenerate and requires inserting an infinitesimally small value called epsilon into an independent empty cell. Optimality is tested using the Modified Distribution or Stepping Stone method. Practical example A tea packaging enterprise based in Kericho operates two processing plants: Factory 1 with a capacity of 100 metric tonnes and Factory 2 with 150 metric tonnes. It supplies warehouses in Kisumu (demand of 120 tonnes) and Nakuru (demand of 130 tonnes). Total supply equals 250 tonnes and total demand equals 250 tonnes, making the model balanced. Unit transport costs in KES per tonne are: Factory 1 to Kisumu: KES 2,000; Factory 1 to Nakuru: KES 2,500. Factory 2 to Kisumu: KES 3,000; Factory 2 to Nakuru: KES 1,800. Using the Least Cost Method: Step 1: Identify the cell with the lowest unit cost, which is Factory 2 to Nakuru at KES 1,800. Allocate the maximum possible amount, which is Nakuru's demand of 130 tonnes. Factory 2 remaining capacity becomes 20 tonnes. Nakuru demand is satisfied. Step 2: The next cheapest remaining open cell is Factory 1 to Kisumu at KES 2,000. Allocate 100 tonnes, exhausting Factory 1 capacity. Kisumu still requires 20 tonnes. Step 3: Allocate the remaining 20 tonnes from Factory 2 to Kisumu at KES 3,000, fully satisfying Kisumu demand and exhausting Factory 2 supply. Total initial shipping cost: (100 tonnes * KES 2,000) + (130 tonnes * KES 1,800) + (20 tonnes * KES 3,000) = KES 200,000 + KES 234,000 + KES 60,000 = KES 494,000.

Quiz

1. Which method for finding an initial basic feasible solution relies on opportunity cost penalties between the two lowest costs in each row and column?

2. What adjustment is necessary when total origin supply does not equal total destination demand?

3. A non-degenerate transportation problem with 3 supply sources and 4 demand centers must have how many allocated cells?

Sign in to submit and securely grade your quiz.