Transportation Problem in LPP - Part 1

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 the Transportation Problem, a specific type of Linear Programming Problem. The instructor begins by defining the problem as one where the goal is to minimize the total transportation cost of moving goods from multiple supply centers to multiple demand centers. He introduces the key components: supply (S_i), demand (D_j), and the cost per unit (C_ij) for transporting from supply center i to demand center j. A diagram is drawn to illustrate the flow from sources (like Kolkata, Delhi, Mumbai) to destinations (like Hyderabad, Patna, Indore). The core of the lesson is the formulation of the Linear Programming model. The objective function is to minimize the total cost, expressed as the sum of the product of the quantity transported (x_ij) and the cost per unit (C_ij) for all supply-demand pairs. The constraints are clearly defined: the total quantity shipped from each supply center i must not exceed its supply S_i, and the total quantity received at each demand center j must meet its demand D_j. The instructor also discusses the condition for a balanced problem, where the total supply equals the total demand, which simplifies the model. The video concludes with the complete mathematical formulation of the problem, including the objective function and all constraints.

Chapters

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

   The video opens with a title, "Linear Programming Problem," written on a whiteboard. The instructor, a man in a dark shirt, begins to explain the Transportation Problem. He states that the objective is to minimize the total amount of transportation cost. He writes the key phrase "Transportation : total amount of transport is minimum cost" on the board, setting the stage for the problem's goal. He then starts to draw a diagram, sketching a source on the left and a destination on the right, with arrows indicating the flow of goods, visually representing the transportation network.

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

   The instructor continues to build the problem's context. He writes a formal definition: "Let A firm produces goods at m different centres (i = 1,2,...,m)". He then lists the supply centers: Kolkata, Delhi, and Mumbai. On the right side of the board, he lists the demand centers: Hyderabad, Patna, and Indore. He introduces the supply at each center as S_i and the demand at each center as D_j. He also introduces the cost of transportation, writing "Cost C_ij" for the cost of transporting one unit from supply center i to demand center j. He draws a diagram showing multiple supply points connected by arrows to multiple demand points, illustrating the network flow.

3. 5:00 – 10:00 05:00-10:00

   The instructor begins to formulate the mathematical model. He defines the decision variable x_ij as the number of units to be transported from supply center i to demand center j. He then writes the objective function: "To find Min ΣΣ x_ij C_ij", which represents the total cost to be minimized. He then writes the first set of constraints: "Subject to the constraints: Σ x_ij ≤ S_i", which states that the total quantity shipped from any supply center i cannot exceed its available supply S_i. He then writes the second set of constraints: "Σ x_ij ≥ D_j", which states that the total quantity received at any demand center j must meet its demand D_j. He also notes that the total supply cannot exceed the total demand, writing "Σ D_j ≤ Σ S_i".

4. 10:00 – 14:43 10:00-14:43

   The instructor discusses the condition for a balanced transportation problem. He writes "Assuming Σ D_j = Σ S_i" and labels this as a "Balanced" problem, which is the standard case for the model. He then rewrites the constraints for this balanced case: "Σ x_ij = S_i" and "Σ x_ij = D_j". He emphasizes that the total supply must equal the total demand. He also notes that the total cost to be minimized is the sum of all x_ij * C_ij. The final formulation is presented as a complete Linear Programming problem: minimize the total cost subject to the supply and demand constraints, with the variables x_ij being non-negative. The instructor points to the diagram and the equations, summarizing the entire model.

The video provides a comprehensive, step-by-step derivation of the Transportation Problem in Linear Programming. It starts with a conceptual understanding of the problem, using a visual diagram to illustrate the flow from supply to demand. It then systematically introduces the necessary variables (supply, demand, cost, and decision variables) and builds the mathematical model from the ground up. The key learning points are the clear definition of the objective function (minimizing total cost) and the two sets of constraints (supply limits and demand requirements). The video effectively transitions from a real-world scenario to a formal mathematical model, culminating in the complete formulation of a balanced transportation problem, which is a fundamental concept in operations research.