Transportation Problem in LPP - Part 2

Duration: 8 min

This video lesson is available to enrolled students.

Enroll to watch — Coal India Management Trainee (CS) Recruitment 2026

AI Summary

An AI-generated summary of this video lecture.

This video is a lecture on solving a Linear Programming Problem, specifically focusing on the Transportation Problem. The instructor begins by introducing the problem and its two main stages: finding an Initial Basic Feasible Solution and then finding the Optimum Solution. He explains the two types of transportation problems: unbalanced (where total supply does not equal total demand) and balanced (where they are equal). The lecture then details the steps for solving the problem, including the creation of a Transportation Table and the use of methods like the North West Corner Method, Least Cost Method, and Vogel's Approximation Method to find the initial solution. The instructor also mentions the Stepping Stone Method and the UV Method for checking and improving the solution to find the optimum. The entire process is explained on a whiteboard with handwritten equations and diagrams.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a whiteboard titled 'Linear Programming Problem'. The instructor begins by discussing the 'Transportation Problem', writing down the condition for feasibility: 'total supply cannot exceed total demand', represented by the inequality Σ Dj ≤ Σ Si. He then introduces the two main stages of the solution: '1. Initial Basic Feasible Solution' and '2. Optimum Solution'. He also writes the condition for a balanced problem, Σ Dj = Σ Si, and mentions that the problem can be either balanced or unbalanced.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues to outline the solution process. He writes 'The Solution of for two stages' and then lists the steps: '1. find Transportation in LP', '2. Transportation Table', '3. Initial B.F. Solution', '4. Optimum Solution', and '5. Check Primal Solution'. He then discusses the methods for finding the Initial Basic Feasible Solution, writing 'North cost corner method', 'Least cost method', and 'Vogel's Approximation (Penalty) method'. He also mentions the 'Stepping Stone' method for the optimum solution.

  3. 5:00 – 8:04 05:00-08:04

    The instructor draws a large grid on the whiteboard, which he labels as the 'Transportation Table'. He explains that this table is used to organize the supply and demand data. He writes 'Cij' in the top-left corner of the table, representing the cost of transporting one unit from source i to destination j. He then draws a large box around the table and labels it 'Balanced Transportation Problem'. He continues to explain the process, mentioning that the goal is to minimize the total transportation cost, which is represented by the formula Min Σ Σ xij * cij. He also writes 'Supply' and 'Demand' on the right and bottom of the table, respectively, to indicate the rows and columns.

The video provides a comprehensive overview of the transportation problem in linear programming. It systematically breaks down the solution process into two main stages: finding an initial feasible solution and then optimizing it. The instructor clearly distinguishes between balanced and unbalanced problems and introduces the key methods for each stage, such as the North West Corner, Least Cost, and Vogel's Approximation methods for the initial solution, and the Stepping Stone and UV methods for the optimum solution. The use of a whiteboard to draw a transportation table and write out the mathematical formulations helps to visually reinforce the concepts being taught.