Best of My Knowledge · YouTube · 10:40
This video segment introduces the Transportation Problem as a special type of Linear Programming Problem (LPP). The primary objective is to minimize the cost of distributing products from multiple sources to multiple destinations. A network diagram illustrates this concept using dairy plants as sources and distribution centers as destinations, with associated transportation costs. This 120-second introductory segment defines the transportation problem as a special linear programming model for minimizing distribution cost from sources to destinations. A handwritten network with three dairy-plant sources, three distribution-centre destinations, and route costs to is used to explain the setup and objective. The clip then turns to a page of standard assumptions: total supply equals total demand, all routes are usable, unit costs are known exactly, and route cost is proportional to shipped quantity. This video uses a handwritten whiteboard to explain the basic assumptions of the transportation model and its subsequent classification. The first half of the page explains sequentially: goods can be shipped from every supply point to every destination; the unit transportation cost for each route is fixed and known, illustrated by the example ; the transportation cost along any given route is directly proportional to the quantity shipped along that route; the goal is to minimize the total transportation cost for the entire organization—not the cost for any single supply point or distribution center. The second half shifts to 'Existence of feasible solution', presenting the criterion: compare total demand and total supply first; if they are equal, a feasible solution exists for the transportation problem. Then, transportation problems are classified into balanced transportation (Demand = Supply) and unbalanced transportation (Demand ≠ Supply), with emphasis that the first step in solving such problems is always to check whether demand equals supply. This segment introduces the fundamental concepts of the transportation problem, including classifying it into balanced and unbalanced types based on the relationship between total demand and total supply, and explaining how to balance the problem by adding a dummy row or column. Next, it details how to construct the transportation problem's tabular (matrix) model, clarifying the positions and meanings of factories, distribution centers, supply, demand, and cells within the matrix. Finally, it lists five common methods for finding an initial basic feasible solution to this problem. This video segment introduces the Transportation Problem, outlining methods to find an initial basic feasible solution, such as the North-West Corner Method and VAM. It then explains the Optimality Test using MODI and Stepping Stone methods. Finally, it defines degeneracy in transportation problems, providing the condition ( = number of allocations) and demonstrating how to check for it with a 4x4 matrix example. This introductory segment explains the concept of degeneracy in transportation problems. It defines the condition for a non-degenerate basic feasible solution, which requires the number of allocations to equal (where m is the number of rows and n is the number of columns). Using a 4x4 grid example with 6 allocations, it demonstrates how to identify a degenerate case (since ). The video outlines the standard solution flowchart: first find a basic feasible solution, then check for degeneracy. If the solution is degenerate, it must be resolved before applying optimality tests such as the MODI or Stepping Stone methods.
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
Hello, friends! In today's video, we will discuss the Transportation Problem. As written on the board, the Transportation Problem is a special type of Linear Programming problem, whose objective is to minimize the cost of distributing products from multiple sources to multiple destinations.
Let us understand what Linear Programming means. It means we have certain resources, and we optimize those resources so that either our profit is maximized or our production cost is minimized. This is called an LPP.
In the Transportation Problem, it is an LPP in which we must minimize the distribution cost, that is, the transportation cost. This occurs when we deliver a product from multiple sources to multiple destinations.
To better understand this, let us look at a graphical representation. Suppose we have an industry that produces goods. These goods go to warehouses, then to retailers through wholesalers, and finally reach customers.
Similarly, here I have taken an example: dairy plants. Suppose we have three dairy plants, which I denote as sources (Source S1, S2, S3), where dairy products are being produced. These products then go to distribution centers, which I represent as demands (Demand d1, d2, d3).
So, production occurs at these sources, and the products must be sent to demand centers. For example, production is happening in various cities such as Delhi, Chennai, and Indore, and they must be sent to various cities such as Kolkata, Bangalore, and Bhopal. On the diagram, the arrows are labeled c1 through c9, representing the transportation cost for each route.
The clip opens on a handwritten definition: the transportation problem is a special type of LPP whose objective is to minimize the cost of distributing a product from several sources to several destinations.
Below that definition, a three-by-three network is shown. The left nodes are Source , Source , Source , identified as dairy plants; the right nodes carry demands , , and are identified as distribution centres, with city names such as Kolkata, Bangalore, and Bihar.
As the pen traces routes from to destinations 1, 2, and 3, the speaker assigns unit transportation costs , , , then similarly , , for source 2. The mathematical meaning is that each edge stores the cost per unit shipped along that route.
The speaker then states the decision task: choose which source sends supply to which destination so that destination demand is satisfied and total transportation cost is minimized.
This is summarized by the written AIM statement: find an optimal solution so as to minimize transportation cost. The logical structure is therefore: data = sources, destinations, route costs; objective = minimum total cost; requirement = meet demand.
The page changes to Assumptions in Transportation Model. Assumption 1 says total supply available at different sources equals total requirement at different destinations, written compactly as Supply = Demand.
The speaker contrasts model assumptions with real life: breakdowns can reduce supply in practice, but the standard model being introduced here assumes exact balance between total supply and total demand.
The clip ends just as Assumption 2 is introduced: the item can be transported conveniently from all sources to destinations. Also visible but not yet fully discussed are Assumption 3, that unit transportation costs are certainly and precisely known, and Assumption 4, that route cost is directly proportional to the number of units.
This segment follows assumption ② in the list of transportation model assumptions. The whiteboard reads 'Item can be transported conveniently from all sources to destinations', which the instructor reads aloud as: 'Items can be transported conveniently from all sources to all destinations.' The key point here is not to compute a specific numerical value, but rather to define the network structure applicable to the model: any source is considered reachable to any destination.
Next comes assumption ③: 'The unit transportation cost of the item from all sources to destinations is certainly and precisely known.' While underlining 'unit transportation cost' with a pen, the instructor explains: when transporting items from one location to another, the unit transportation cost along each route must be known in advance. To make this statement more concrete, the board displays notation beside it, and the instructor verbally identifies it as the known unit transportation cost along the route from source one to demand center one. This step grounds the abstract assumption onto a specific route.
Then comes assumption ④: 'The transportation cost on a given route is directly proportional to the number of units shipped on that route.' The instructor rephrases it as a directional relationship: as the number of units shipped along a given route increases, the transportation cost along that route also increases. Arrows pointing upward appear near 'cost' and 'units' in the visual, indicating that the mathematical meaning here is not fixed cost, but a direct proportionality—i.e., 'increase together'. Although no algebraic expression appears on screen, the verbal explanation clearly conveys 'directly proportional'.
Assumption ⑤ clarifies the objective function: 'the objective is to minimize the total transportation cost for the organisation as a whole and not for individual supply and distribution centres.' The instructor emphasizes that the optimization target is neither the cost of any single supply point nor that of any single distribution centre, but rather the total transportation cost at the organisational level. To help distinguish 'whole' from 'individual', he writes and below the page and links them to 'individual supply and distribution centres' in assumption ⑤. This naturally leads into the next section: since the problem involves both demand and supply sides, the first step is to examine the relationship between their total quantities.
The screen switches to a new page titled 'Existence of feasible solution'. This page first presents a decision flow: for a transportation problem, the first step is to compare total demand and total supply. The board states the key condition as , with a checkmark above the equals sign; the next line reads 'Then feasible solution exists for transportation problem.' The instructor explains in sync: if total demand equals total supply, then a feasible solution exists for this transportation problem. Here the video explicitly gives only the implication 'equality ⇒ existence of feasible solution'.
In the lower half of the same page, the video further classifies transportation problems into two types: a) Balanced Transportation and b) Unbalanced Transportation. Next to the former appears , and next to the latter appears . The instructor stresses that, whenever encountering a transportation problem, the very first step is to compare demand and supply totals; if total demand equals total supply, the problem falls into the balanced category. Thus, the earlier criterion for existence of a feasible solution directly connects to the subsequent classification of problems.
At the beginning of the video, two basic types of transportation problems are presented on a whiteboard. First, "balanced transportation" is defined, whose key condition is that total demand equals total supply, i.e., . Then, "unbalanced transportation" is defined, whose condition is that total demand does not equal total supply, i.e., .
For unbalanced transportation problems, the instructor explains that they can be converted into balanced ones by adding a "dummy row or column", enabling standard solution methods to be applied. This conversion process will be further clarified in subsequent concrete problem-solving steps.
Next, the video moves to the "formulation of the transportation problem". On the whiteboard, the instructor draws a table (also called a matrix). Row labels on the left side are labeled "Plants", representing manufacturing locations; column labels at the top are labeled "Distribution Centre", representing demand locations.
On the right side of the table, is labeled, representing the "Supply" from each plant. Below the table, is labeled, representing the "Demand" at each distribution centre. Each small square inside the table is called a "Cell".
The instructor explains that these cells typically contain the "transportation cost" from a specific plant to a specific distribution centre. Additionally, if a cell is specially marked (e.g., a square with a corner fold as shown in the diagram), it indicates an "Allocated Cell", meaning actual goods transportation occurs along that route.
Finally, the video lists five common methods for finding an "Initial basic feasible solution" to the transportation problem: 1) North-west Corner Method, 2) Row Minima Method, 3) Column Minima Method, 4) Least Cost Method or Matrix Minima, 5) Vogel's Approximation Method (VAM) or Penalty Method.
This video segment introduces methods to find an initial basic feasible solution for solving the transportation problem. Five main methods are listed on the board: 1) North-West Corner Method, 2) Row Minima Method, 3) Column Minima Method, 4) Least Cost Method or Matrix Minima, and 5) VAM (Vogel's Approximation Method), also known as Penalty Method or Regret Method. These methods help us obtain a feasible solution to the transportation problem.
However, it is important to note that the feasible solution obtained from these methods is not always optimal. Therefore, further methods are used to test the optimality of the solution. Two optimality test methods are shown on the board: 1) MODI (Modified Distribution) Method, also called UV Method, and 2) Stepping Stone Method. Using these methods, we can determine whether our initial basic feasible solution is indeed optimal.
Next, the video explains the concept of 'Degeneracy in Transportation'. When we obtain a basic feasible solution using any method, we must check whether the number of allocations equals , where m is the number of rows and n is the number of columns. If the number of allocations does not equal , then degeneracy exists in the problem.
As an example, a 4x4 matrix is shown with 6 allocations. Here, and . Therefore, should equal . Since the actual number of allocations is 6, which is not equal to , degeneracy exists in this transportation problem. This degeneracy must be resolved before performing the optimality test.
Let us understand the concept of degeneracy in transportation problems. When preparing to apply optimality tests such as the MODI or Stepping Stone method, we must ensure that our initial basic feasible solution is not degenerate.
A solution is non-degenerate if the number of allocated cells equals exactly , where is the number of rows and is the number of columns. If the allocations are fewer than this, the solution is degenerate and must be resolved before proceeding to optimality tests.
Consider the logical flowchart for solving transportation problems: first, find a basic feasible solution using methods such as north-west corner, row minimum, column minimum, least cost, or VAM. Then, check whether the number of allocations equals .
For example, consider a table with 6 allocations. The required number is . Since , this solution is degenerate. In this case, you must resolve degeneracy before applying the MODI or Stepping Stone method. If the allocations were 7, we could proceed directly to optimality testing.
The transportation problem is a special type of linear programming problem (LPP). Its main objective is to minimize the total cost of distributing goods from multiple sources (such as factories or dairy plants) to multiple destinations (such as warehouses or distribution centers).
Linear programming is a mathematical method for optimizing the use of limited resources. Its objective is either to maximize profit or to minimize cost. The transportation problem is a specific application of this, where cost is minimized.
As a practical example, products must be delivered from dairy plants (sources S1, S2, S3) to distribution centers (demands d1, d2, d3). Each source-destination pair has a specific transportation cost (c_ij), shown on the arrows in the diagram. The goal of the problem is to find a distribution plan that minimizes the sum of all these costs.
The transportation problem is introduced as a special linear programming problem concerned with minimizing the cost of moving a product from multiple sources to multiple destinations while satisfying destination requirements.
A handwritten bipartite network places sources ,, on the left and destinations with demands ,, on the right. Each connecting edge carries a cost label such as ,,,, representing unit transportation cost on that route.
The stated aim is to decide shipments from sources to destinations so that all demand is met and total transportation cost is as small as possible. This is written on the board as finding an optimal solution to minimize transportation cost.
The first formal assumption is that total supply across all sources equals total requirement across all destinations. The speaker notes that real disruptions may occur, but the model under discussion assumes equality.
The second assumption says the item can be transported conveniently from all sources to destinations, meaning the basic model does not exclude any route.
The third assumption states that the unit transportation cost from every source to every destination is certainly and precisely known. The example notation illustrates a single route whose cost is treated as deterministic data.
The fourth assumption states that transportation cost on a given route is directly proportional to the number of units shipped, so total route cost is unit cost times quantity.
In the list 'Assumptions in Transportation Model', the video first presents assumption ②: items can be transported conveniently from all sources to all destinations. It specifies the reachability premise of the model—that is, no route is treated as unavailable.
Rule ③ states that the unit transportation cost from any supply point to any demand point is deterministic and precisely known. The instructor illustrates this using , showing that when supplying from the 1-th supply point to the 1-th demand point, the unit transportation cost along this route must be known in advance.
The on the board is not a new theorem but an instantiation of Assumption ③: denotes the 1-th supply point, denotes the 1-th demand point, and the arrow represents the transportation route from the supply point to the demand point. Through this, the instructor clarifies that 'known unit transportation cost' applies to each specific route.
Assumption ④ states that the transportation cost along a given route is proportional to the number of units shipped along that route. The instructor interprets this as 'as quantity increases, cost increases', and reinforces this direct relationship with an upward arrow. Although the video does not write a formal algebraic expression, the meaning of proportionality is explicitly stated.
Assumption ⑤ defines the objective as minimizing the total transportation cost for the entire organization, rather than the costs of individual supply and distribution centres. To clarify that the transportation problem involves both demand and supply sides, and that the optimization objective is the global total cost, the instructor additionally writes and .
The video emphasizes that the objective is not to minimize the cost of just one supply point or one distribution centre, but to minimize the total transportation cost of the whole process. This distinction is clarified by contrasting 'organisation as a whole' with 'individual supply and distribution centres'.
After introducing 'Existence of feasible solution', the instructor's first step is to compute and compare total demand and total supply. If these two quantities are equal, then the transportation problem is said to have a feasible solution. The board writes this condition as , and below it writes 'Then feasible solution exist for transportation problem'.
The video classifies transportation problems into two types: Balanced Transportation corresponds to , and Unbalanced Transportation corresponds to . The classification criterion is whether total demand equals total supply.
At the end, the instructor emphasizes that whenever you encounter a transportation problem, the very first thing to do is to extract and compare demand and supply. This step serves both as the basis for determining whether the problem is balanced or unbalanced, and as the prerequisite for discussing the existence of a feasible solution.
Transportation problems are classified into two types based on the relationship between total demand and total supply. If the total supply from all factories equals the total demand from all distribution centers (), it is called a balanced transportation problem. If they are not equal (), it is called an unbalanced transportation problem.
To apply standard algorithms to solve unbalanced transportation problems, we usually convert them into balanced ones. This conversion is done by adding a dummy row (if total demand exceeds total supply) or a dummy column (if total supply exceeds total demand), whose supply or demand exactly offsets the difference, and the corresponding transportation cost is typically set to zero.
A transportation problem can be visually represented using a two-dimensional table or matrix. The rows of the matrix represent supply sources (e.g., plants), and the columns represent demand destinations (e.g., distribution centers). The supply amounts for each row (Supply ) are recorded to the right of the matrix, and the demand amounts for each column (Demand ) are recorded below the matrix. The cells inside the matrix represent transportation routes from specific supply sources to specific demand destinations, and are typically used to enter unit transportation costs or actual allocation quantities.
After constructing the table model for a transportation problem, the first step is to find an initial basic feasible solution. The video lists five commonly used heuristic methods: the northwest corner method, the row minimum method, the column minimum method, the least-cost method (matrix minimum method), and Vogel’s approximation method (penalty method). Each method has its own characteristics and is used to quickly determine an initial allocation scheme satisfying supply and demand constraints.
These are the techniques used to find a starting feasible solution for a transportation problem. The video lists five methods: North-West Corner Method, Row Minima Method, Column Minima Method, Least Cost Method (or Matrix Minima), and VAM (Vogel's Approximation Method, also known as Penalty or Regret Method).
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The text 'LPP (Linear Programming)' appears on the whiteboard.
The speaker says 'LPP' and 'Linear Programming'.
LPP
Linear Programming Problem
Optimization
The diagram shows the labels 'Source S1', 'Source S2', and 'Source S3'.
The speaker mentions 'sources' and 'dairy plants'.
Source i (for example, a dairy plant)
Transportation Problem
The diagram shows the labels 'Demand d1', 'Demand d2', and 'Demand d3'.
The speaker mentions 'destinations' and 'distribution centers'.
Demand at destination j (for example, a distribution center)
Transportation Problem
The text 'c1', 'c2', 'c3', 'c4', 'c5', 'c6', 'c7', 'c8', 'c9' appears on the arrows linking sources to destinations.
The speaker refers to the cost of distribution.
The precise meaning of each c_ij (for example, the cost per unit from source i to destination j) is not explicitly given but follows the standard interpretation for this kind of problem.
c_{ij}
The cost of transporting from source i to destination j
Transportation Problem
Left column of the network diagram is labeled Source , Source , Source .
The speaker refers to sources one, two, and three while explaining supply from each source.
Transportation source or supply point; in the example the sources are dairy plants.
\{1,2,3\} in the displayed example
Right column of the network diagram is labeled Demand , Demand , Demand .
The speaker says demand can be supplied from multiple sources.
Demand at destination j, shown as a distribution centre requirement.
\{1,2,3\} in the displayed example
Destination nodes are annotated with city names Kolkata, Bangalore, and Bihar.
The speaker names Kolkata, Bangalore, and Bihar as cities.
The exact mapping between node numbers and city labels is visually crowded but consistently shows three destinations.
Destination cities
Concrete names used for the three demand points in the example.
Edges between sources and destinations are labeled through .
The speaker says transportation cost per unit from to 1 is , to 2 is , to 3 is , and similarly , , for source 2.
The video uses single-index labels ,..., on edges rather than explicit double-index notation.
c_{ij}
Unit transportation cost from source i to destination j; in the board example these are denoted by edge labels ,...,.
Assumption 1 page contains the handwritten note Supply = Demand.
The speaker states total quantity of item supply available at different sources is equal to total requirement, i.e., demand.
Supply = Demand
Balanced transportation model condition: total available supply equals total required demand.
Assumption 3 page contains the handwritten route example -> .
appears only on the assumptions page and is not separately defined there.
Example notation for a route from source 1 to destination 1 when discussing known unit transportation cost.
Next to assumption ① on the whiteboard, 'Supply = Demand' is written in red.
Supply = Demand
In the transportation model, total supply equals total demand.
The total quantity condition for transportation problems.
Next to assumption ③ on the whiteboard, '' is written in red.
The instructor says, 'When we supply from source one, S1, to demand center one, the unit transportation cost will be known to us.'
An example of a transportation route from supply point 1 to demand point 1.
Transportation route notation.
Written definition: 'The transportation problem is a special type of LPP (Linear Programming) where the objective is to minimize the cost of distributing a product from a number of sources to a number of destinations.'
The speaker reads aloud and explains the definition of the transportation problem.
The transportation problem is a particular kind of Linear Programming Problem (LPP). Its main goal is to minimize the total cost of distributing a product from several sources—such as factories or dairy plants—to several destinations—such as warehouses or distribution centers.
It is a kind of Linear Programming Problem.
The aim is to minimize cost.
It includes multiple sources and multiple destinations.
The speaker explains: 'What does linear programming mean? We have certain resources, and we optimize those resources to either maximize our profit or minimize our production cost.'
Linear Programming involves optimizing a set of resources. The optimization can be either maximizing profit or minimizing production costs.
Involves resources.
Objective is optimization (maximize profit or minimize cost).
Top of first page reads: Special type of LPP (Linear Programming Problem) where the objective is to minimize the cost of distributing a product from a number of sources to a number of destinations.
The speaker explains that the transportation problem minimizes transportation cost while satisfying distribution-centre demand.
The transportation problem is presented as a special type of linear programming problem whose objective is to minimize the cost of distributing a product from several sources to several destinations while meeting demand.
There are multiple sources and multiple destinations.
Each source-to-destination route has an associated transportation cost.
The goal is cost minimization subject to satisfying demand.
A bipartite-style network is drawn with Source , , on the left and Demand , , on the right, connected by edges labeled ,...,.
The speaker points to routes from to destinations 1, 2, 3 and assigns costs , , , then similarly for source 2.
The board uses a network diagram to represent the transportation model: sources are placed on one side, destinations on the other, and each possible route is drawn as an edge carrying a unit transportation cost label.
Sources and destinations are treated as separate node sets.
Edges represent feasible transport routes.
Edge labels represent unit costs.
Lower part of first page states: AIM To find out optimal solution so as to minimize transportation cost.
The speaker says the aim is to minimize transportation cost and produce an optimal solution.
The stated objective is to find an optimal allocation of shipments from sources to destinations so that total transportation cost is minimized while demand is fulfilled.
Demand at destinations must be satisfied.
Total transportation cost is to be minimized.
Assumption 1 text: Total quantity of item (Supply) available at different sources is equal to the total requirement at different destinations.
The speaker explicitly says supply is equal to demand and adds that practical disruptions may occur but the model assumes equality.
The first modeling assumption is that total supply across all sources equals total demand across all destinations, making the transportation model balanced.
The model is being formulated under standard assumptions.
Total supply and total demand are compared over all sources and destinations.
Assumption 2 text: Item can be transported conveniently from all sources to destinations.
The speaker begins reading the second assumption before the clip ends.
Only the beginning of the spoken explanation for Assumption 2 is present in this clip.
The second assumption states that the item can be transported conveniently from every source to every destination, implying no route restrictions in the basic model.
Every source-destination pair is considered feasible for transport.
Assumption 3 text: The Unit transportation cost of the item from all sources to destinations is certainly and precisely known.
The route example -> is written beside this assumption.
The audio explanation for Assumption 3 is not fully developed within this clip.
The third assumption is that the unit transportation cost for each route from any source to any destination is known exactly and certainly.
Each route has a definite unit cost.
Costs are treated as deterministic data in the model.
Assumption 4 text: The transportation cost on a given route is directly proportional to the number of units.
No spoken elaboration for Assumption 4 is audible in this clip.
The fourth assumption states that on a given route, transportation cost varies directly with the number of units shipped.
A fixed route is chosen.
Shipped quantity changes while unit cost remains the same.
The second point on the whiteboard reads: 'Item can be transported conveniently from all sources to destinations.'
The instructor reads aloud: 'transported conveniently from all sources to destinations.'
This assumption states that items can be conveniently transported from all supply points to all destinations, meaning the model does not account for cases where certain routes are inaccessible.
Fundamental Assumptions Applicable to the Transportation Model
The video does not explain how to handle infeasible routes.
The third point on the whiteboard reads: "The unit transportation cost of the item from all sources to destinations is certainly and precisely known."
The instructor says, 'We know the unit transportation cost for each item when we transport it from one location to another,' and gives the example, 'When we supply from source one, S1, to demand center one, the unit transportation cost will be known to us.'
The instructor underlines "Unit transportation cost" with a pink pen and points to .
This assumption states that the unit transportation cost from any source to any destination is deterministic and precisely known. The instructor uses as an example, indicating that the unit transportation cost from the 1th source to the 1th destination must be known in advance.
Applies to every route in the transportation model.
The video does not explain how to handle cases where costs fluctuate randomly.
The fourth point on the whiteboard reads: "The transportation cost on a given route is directly proportional to the number of units shipped on that route."
The instructor says, "The transportation cost on a given route is directly proportional to the number of units shipped on that route—so as the number of units increases, the transportation cost also increases."
The instructor draws red upward arrows near "cost" and "units" to indicate that both increase in the same direction.
This assumption states that the transportation cost on a given route is proportional to the number of units shipped on that route. The presenter explains orally: as the number of units increases, the transportation cost also increases.
for a single route
The video does not specify a symbol for the proportionality constant.
Assumption 1 page states total supply equals total requirement, with Supply = Demand written beside it.
The speaker says that although practical events such as machine breakdown can reduce supply, the problem-solving assumption is supply equal to demand.
In the transportation model introduced here, one assumes .
The discussion is about the standard assumptions of the transportation model.
Supply means total available quantity at sources and demand means total requirement at destinations.
For the whole system of sources and destinations, total supply is taken to equal total demand.
The AIM statement on the first page reads: To find out optimal solution so as to minimize transportation cost.
The speaker says the aim is to minimize transportation cost and produce an optimal solution.
The goal of the transportation problem is to determine an optimal shipment plan that minimizes total transportation cost while satisfying destination demand.
There are defined sources, destinations, and route costs.
Demand must be met.
Over all feasible allocations from sources to destinations, choose one with minimum total cost.
The board writes Total Demand = Total Supply, followed on the next line by Then feasible solution exist for transportation problem.
The instructor says, "If total demand equals total supply, what do we say? That a feasible solution exists for that transportation problem."
The video does not state whether a feasible solution necessarily does not exist when Total Demand ≠ Total Supply, nor does it state whether conversion to a balanced problem is required.
If Total Demand = Total Supply, then the transportation problem has a feasible solution.
Given a transportation problem
Total demand and total supply have been computed
They are equal
For a transportation problem, if total demand equals total supply, then a feasible solution exists.
a) Balanced Transportation, with 'Demand = Supply' written beside it.
The instructor says, 'In balance, demand equals supply; total demand equals total supply.'
A balanced transportation problem is a transportation problem in which total demand equals total supply.
The topic under discussion is the transportation problem
The quantities being compared are total demand and total supply
The video calls it balanced transportation if and only if demand equals supply.
If this condition is not satisfied, we encounter the case of degeneracy, which we must resolve first before performing these optimality tests.
4 plus 4 minus 1 equals 7, which is not equal to 6
If the number of allocations in a basic feasible solution is not equal to , the solution is degenerate, and this degeneracy must be resolved before performing an optimality test.
A basic feasible solution has been found for a transportation problem.
For all transportation problems
The speaker says: from to 1 the transportation cost per unit is , to 2 is , to 3 is ; similarly for source 2 the costs are , , .
Edges from the left source nodes to the right destination nodes carry labels through .
The board uses sequential edge labels rather than explicit double-index notation, so the mapping to c_{ij} is inferred from the spoken pattern.
Identify the left-side source nodes , , and the right-side destination nodes 1, 2, 3.
These labels are visibly written on the diagram.
Trace the edges from to destinations 1, 2, 3 and read their labels as , , .
The speaker explicitly assigns these costs while pointing along the routes.
Repeat the same reading for , obtaining , , for its three outgoing routes.
The speaker states these values in sequence after the first source.
Interpret each edge label as the unit transportation cost from source i to destination j.
This matches the verbal description of transportation cost per unit on each route.
The diagram encodes a full set of route-specific unit costs between sources and destinations, which are the data used in the transportation model.
The presenter says, 'As the number of units increases, the transportation cost also increases.'
The presenter draws red upward arrows next to 'cost' and 'units' in assumption ④.
The video does not write the algebraic form, such as or .
First state assumption ④: the transportation cost on a given route is directly proportional to the number of units shipped along that route.
Text from assumption ④ on the whiteboard.
Then interpret the text in terms of directional change: as the number of units increases, the transportation cost increases.
From the presenter's verbal explanation and the upward arrow annotations.
The video uses text and arrows to illustrate the intuitive idea that 'an increase in quantity leads to an increase in cost', but gives no formal algebraic expression.
() ≠ 6
So, what is the number of rows? We have four, right? And what is n? The number of columns is also four. Four plus four minus one gives seven. Is this seven equal to the number of allocations? The allocations are 1, 2, 3, 4, 5, and 6—so the number of allocations is not equal to seven. What does this mean? Degeneracy exists in the transportation problem.
Identify the number of rows and columns from the given matrix.
Visual observation of the matrix.
Calculate the expected number of allocations for a non-degenerate solution.
Applying the formula for degeneracy condition.
Count the actual number of allocated cells in the matrix.
Visual counting of the marked cells.
Compare the expected number of allocations with the actual number.
Numerical comparison.
Conclude that the problem is degenerate because the numbers do not match.
Definition of degeneracy in transportation problems.
The given transportation problem is degenerate.
First, we find a basic feasible solution; then we check this condition; if it is satisfied, we apply the optimality test directly; if it is not satisfied, we encounter the case of degeneracy, which we resolve first before performing the optimality test.
Flowchart structure with arrows connecting steps
Start by finding an initial basic feasible solution using methods like North-West, Row Minima, etc.
Audio and visual list of methods.
Verify the number of allocations against the required .
Audio and visual formula.
If the condition is met, proceed directly to optimality testing.
Audio explanation of the satisfied condition.
If the condition is not met, the solution is degenerate; resolve it first, then apply the optimality test.
Audio explanation of the unsatisfied condition and visual flowchart arrow.
The standard procedure requires checking for degeneracy before applying optimality tests.
Diagram shows 'Source S1 (Delhi)', 'Source S2 (Chennai)', 'Source S3 (Indore)' connected to 'Demand d1 (Kolkata)', 'Demand d2 (Bangalore)', 'Demand d3 (Bhopal)' with costs c1 to c9.
The speaker describes a scenario with dairy plants as sources and distribution centers as destinations, mentioning cities like Delhi, Chennai, Indore, Kolkata, Bangalore, and Bhopal.
The exact numerical values for costs c1 to c9 are not provided, only their symbolic representation.
Minimize the cost of distributing dairy products from three plants (Delhi, Chennai, Indore) to three distribution centers (Kolkata, Bangalore, Bhopal).
Sources: S1 (Delhi), S2 (Chennai), S3 (Indore)
Destinations: d1 (Kolkata), d2 (Bangalore), d3 (Bhopal)
Transportation costs: c1, c2, c3, c4, c5, c6, c7, c8, c9
Find the distribution plan that minimizes the total transportation cost.
Identify the sources (dairy plants) and the destinations (distribution centers).
Based on the problem description and the diagram.
Note the transportation costs (c_ij) between each source–destination pair.
These costs are shown as labels on the arrows in the diagram.
Formulate the objective function to minimize the sum of (cost times quantity transported) over all routes.
This is the core definition of the transportation problem.
The optimal distribution plan that minimizes the total cost.
Not explicitly shown in this introductory segment.
The lower labels on the first page identify the left group as (Dairy Plants) and the right group as (Distribution Centre).
The speaker names Kolkata, Bangalore, and Bihar as destination cities and discusses supplying demand from multiple sources.
Exact numeric supplies and demands are not given in this clip; only symbolic labels and route costs are shown.
Use a network of three sources and three destinations to illustrate how a transportation problem is set up and what its objective means.
Three sources , , are shown as dairy plants.
Three destinations with demands , , are shown as distribution centres.
Route costs are labeled through .
Destination city names include Kolkata, Bangalore, and Bihar.
Understand how sources, destinations, and unit route costs define the transportation problem and its minimization objective.
Place the sources on the left and destinations on the right to form a bipartite transport network.
This is the structure visibly drawn on the board.
Label each feasible route with a unit transportation cost .
The speaker assigns , , from and continues with , , for .
State that a destination such as may receive supply from more than one source.
The speaker explicitly says demand can be supplied from multiple sources.
Formulate the aim as finding the optimal solution that minimizes transportation cost.
This is written in the AIM statement on the same page.
The example models distribution from dairy plants to distribution centres as a cost-minimization transportation problem with route costs attached to each source-destination pair.
The interpretation is consistent with both the written definition at the top of the page and the AIM statement at the bottom.
The whiteboard shows .
The presenter says, 'From source S1, when we supply to demand center one, its unit transportation cost will be known to us.'
Explain what it means for the unit transportation cost from a given supply point to a given demand point to be known.
There exists a supply point .
There exists a demand point .
Consider the transportation route from to .
Use a specific route example to explain Assumption ③.
Take the route from the 1th supply point to the 1th demand point as an example.
The notation is written directly on the board.
The instructor explains: when supplying from to , the unit transportation cost along this route must be known.
Audio explanation of .
denotes a specific transportation route, whose unit transportation cost is assumed to be deterministic and known in the model.
This example matches the wording of Assumption ③.
An 4 by 4 matrix with 6 allocated cells.
() ≠ 6
Determine whether the given 4 by 4 transportation problem is degenerate.
An 4 by 4 matrix representing a transportation problem.
The number of allocated cells is 6.
Check whether the number of allocations equals m plus n minus 1.
Identify the dimensions of the matrix.
Visual observation.
Calculate the required number of allocations for a nondegenerate solution.
Formula for the degeneracy condition.
Count the allocated cells in the matrix.
Visual counting.
Compare the calculated value with the actual number of allocations.
Numerical comparison.
The problem is degenerate because the number of allocations (6) is not equal to .
The conclusion is verified by the direct application of the degeneracy condition formula.
() ≠ 6
4 by 4 grid with 6 L-shaped marks indicating allocations
Determine if a basic feasible solution with 6 allocations in a 4 by 4 transportation matrix is degenerate.
Number of rows (m) = 4
Number of columns (n) = 4
Number of allocations = 6
Check if the number of allocations equals .
Calculate the required number of allocations for a non-degenerate solution.
Formula from the video.
Compare the required number of allocations with the actual number.
Arithmetic comparison.
The solution is degenerate because the number of allocations (6) is not equal to .
Visual comparison of the calculated value 7 and the given allocation count 6.
A hand-drawn network diagram on a whiteboard showing three sources (S1, S2, S3) on the left and three destinations (d1, d2, d3) on the right, connected by arrows labeled with costs (c1 to c9).
Sources (S1, S2, S3)
Destinations (d1, d2, d3)
Transportation routes (arrows)
Costs (c1 to c9)
The structure of sources connecting to destinations.
The presence of costs on each route.
Visually represents the flow of goods from multiple origins to multiple destinations, with associated transportation costs for each direct route.
A hand with a pink pen points around a handwritten network diagram with three source nodes on the left and three demand nodes on the right.
The pen moves from source nodes to destination nodes and along edges while the speaker names costs , , , etc.
Source nodes , ,
Destination nodes labeled 1, 2, 3 with demands , ,
Edges labeled ,...,
City labels including Kolkata, Bangalore, Bihar
AIM text at the bottom
The pen indicates different source-destination routes in sequence.
Attention shifts from individual edge costs to the overall objective statement.
The graph remains a three-by-three source-destination network.
Edge labels continue to represent route costs.
The visual walkthrough establishes how each route carries a unit cost and how the whole network represents a transportation allocation problem.
The first sheet is lifted and replaced by a new page headed Assumptions in Transportation Model.
First page with network diagram
Second page titled Assumptions in Transportation Model
The visible content changes from a diagrammatic example to a numbered list of assumptions.
The topic remains the transportation problem.
The page turn marks a shift from intuitive model setup to formal modeling assumptions.
A handwritten numbered list shows four assumptions, with Supply = Demand and -> written in red ink.
The pen points to Assumption 1 and later to Assumption 2 near the end of the clip.
Assumption 4 is visible but not verbally explained within this clip.
Heading: Assumptions in Transportation Model
Numbered items 1 to 4
Red annotations Supply = Demand and ->
The pen emphasizes the first assumption while the speaker explains balance of supply and demand.
Near the end, attention moves to the second assumption.
All four assumptions remain visible on the page once it appears.
The page formalizes the basic conditions under which the transportation model is analyzed.
The instructor underlines 'Unit transportation cost' with a pink pen and moves the pen tip to .
Text of Assumption ③
Notation
Pink pen
'Unit transportation cost' is underlined for emphasis
Attention shifts to
The assumption text itself remains unchanged
The position of remains unchanged
Visually grounding the abstract condition 'unit transportation cost is known' onto a concrete route example.
In Assumption ④, the instructor draws a red upward arrow near 'cost' and 'units'.
Assumption number four
red upward arrow
upward arrow appears next to cost
upward arrow appears next to units
direct proportion relationship text remains unchanged
the arrow explains 'directly proportional' as both quantities increasing in the same direction
The instructor writes (Demand) and (Supply) at the bottom of the page and connects them with lines to the individual supply and distribution centers mentioned in assumption number five.
Assumption number five
(Demand)
(Supply)
connecting line
Add the terms 'Demand' and 'Supply'.
Display lines connecting item ⑤ to these two terms.
Keep item ⑤ unchanged.
Visually illustrate that the transportation problem involves both the demand side and the supply side, and that the objective is to minimize the total cost rather than the cost on one side alone.
The screen switches to a new page titled 'Existence of feasible solution'.
The previous page's list of assumptions.
The new page's title: 'Existence of feasible solution'.
Replace the entire content of the page.
The topic shifts from 'assumptions' to 'feasibility'.
The presentation remains in handwritten whiteboard style.
Structurally, we move to the next section: first determine whether a feasible solution exists for the transportation problem.
A check mark appears above the equals sign in 'Total Demand = Total Supply', and the instructor repeatedly points to this line with a pen.
Total Demand = Total Supply
check mark
pink pen
pen tip points to the equation multiple times
the check mark above the equals sign is emphasized
the lower 'Total Demand ≠ Total Supply' is not checked
visually mark 'equality' as the key branch indicating that a feasible solution exists.
The instructor draws red curly braces on both sides of 'Demand = Supply' and points to this equation.
Demand = Supply
red curly brace
pink pen
both sides of the equation are enclosed in parentheses
the instructor repeatedly points to this condition
b) Unbalanced Transportation's Demand ≠ Supply remains unemphasized in the same way
visually highlights that the core criterion for balanced transportation is equality of demand and supply
The instructor draws and labels the structure of the transportation problem table step by step on the whiteboard, including rows, columns, supply, demand, and the meaning of cells.
4 by 4 grid table
Plants label
Distribution Centre label
Supply label
Demand label
Cells legend
Allocated Cell legend
Drawing the table from scratch
Adding row and column labels
Adding supply and demand symbols
Explaining the meaning of cells
The table maintains the 4x4 structure
Intuitively demonstrates the tabular representation method for the transportation problem mathematical model.
A 4 by 4 grid is drawn, and 6 cells are marked with small squares to represent allocations.
4 by 4 grid
Allocated cells
The grid is drawn.
Six cells are marked as allocated.
The grid remains 4 by 4 throughout the segment.
The visual representation helps in counting the number of allocations to check for degeneracy.
The speaker says practically anything can happen, for example machine breakdown can stop production and reduce supply, but in the model we assume supply equals demand.
One might think the transportation model must always allow unequal supply and demand because real systems can suffer disruptions.
The video distinguishes practical variability from the modeling assumption: for the standard transportation model discussed here, total supply is assumed equal to total demand.
the instructor emphasizes that the objective is to minimize the total transportation cost for the organization as a whole, not to minimize the cost of any single supply or any single route
the instructor connects (Demand) and (Supply) to individual supply and distribution centres to help distinguish between overall and local perspectives
interpreting the objective as optimizing the cost of only one supply centre or only one distribution centre
the video explicitly states that the objective is to minimize the total transportation cost for the entire organization, not the costs of individual supply and distribution centres
the instructor says "this is always the very first thing we must do whenever solving a problem: examine demand and supply"
Solve the transportation problem directly without first comparing total demand and total supply.
The video emphasizes that the first step in every transportation problem must be to check whether demand equals supply.
The written definition states 'The transportation problem is a special type of LPP (Linear Programming).'
The speaker says 'the transportation problem is a special type of linear programming'.
The transportation problem is presented as a specific application or subset of general Linear Programming problems.
The definition at the top mentions sources and destinations, and the diagram below instantiates them as and with route costs.
The abstract definition of the transportation problem is applied through a concrete network diagram showing sources, destinations, and route costs.
After tracing route costs, the pen moves to the AIM statement at the bottom of the same page.
Understanding the route-cost network is prerequisite to interpreting the objective of minimizing total transportation cost.
The page changes from the AIM statement to the Assumptions in Transportation Model list.
The optimization objective is then placed under explicit modeling assumptions, beginning with balance of total supply and total demand.
Assumption 3 states unit transportation cost is known; Assumption 4 states route cost is directly proportional to number of units.
Proportionality of route cost to shipped quantity presupposes that a definite unit cost for that route is already known.
After reading item ③, the instructor immediately gives the example .
is written beside item ③.
is a concrete example illustrating the abstract assumption that unit transportation costs are known.
The instructor interprets item ④ as meaning that cost increases when quantity increases.
An upward arrow appears together with the verbal explanation.
Intuitive derivation relies on the 'proportional' assumption in item ④, used to illustrate that two variables change in the same direction.
The slide transitions from assumptions to existence of feasible solution.
The instructor first summarizes that demand and supply are central to the problem, then moves on to the next topic: existence of feasible solution.
The video frames the transportation problem as overall cost minimization centered on demand and supply, and only later introduces feasibility assessment based on comparing total demand and total supply.
On the same page, first write Existence of feasible solution and Total Demand = Total Supply; then write Types of Transportation Problems and the balanced/unbalanced conditions.
The instructor first explains that equality implies existence of a feasible solution, then explains that types are divided into balanced and unbalanced.
The criterion for determining existence of a feasible solution directly leads to the classification of transportation problems based on whether demand equals supply.
a) Balanced Transportation corresponds to Demand = Supply; b) Unbalanced Transportation corresponds to Demand ≠ Supply.
Within the same classification framework, balanced and unbalanced form a contrast based on whether demand equals supply.
The instructor explains that converting an unbalanced problem into a balanced one is done by adding a dummy row or column.
The method of adding dummy rows or columns is applied to unbalanced transportation problems to convert them into balanced ones.
After introducing the table, the instructor immediately lists the solution methods.
Constructing the transportation problem table is a prerequisite for applying various initial basic feasible solution methods.
The definition of the Transportation Problem is written on the board.
The speaker defines the Transportation Problem.
The definition states that a Transportation Problem is a 'special type of LPP'.
The speaker explains that a Transportation Problem is a special type of linear programming problem.
Top-of-page definition text is visible.
The speaker assigns , , to routes from and continues with , , for .
AIM statement at the bottom of the first page.
Assumption 1 text and Supply = Demand annotation.
The speaker explains that the model assumes supply equals demand despite practical disruptions.
Four numbered assumptions are visible on the second page.
Only Assumptions 1 and the start of 2 are audibly discussed in this clip.
Assumption number three is clearly visible in the written text.
The instructor reads this assumption sentence by sentence and explains it.
is written beside assumption number three.
The instructor uses it as an example to illustrate that unit transportation cost is known.
Assumption number four states directly proportional to the number of units shipped on that route.
The upward arrow indicates simultaneous increase.
Clause ⑤ states that the objective is to minimize the total transportation cost for the organisation as a whole.
The presenter emphasizes that it is not for individual supply and distribution centres.
After 'Total Demand = Total Supply', it says 'Then feasible solution exists for transportation problem.'
The presenter explicitly states that a feasible solution exists when they are equal.
Covered · This entire segment introduces the Transportation Problem, its definition, its relation to Linear Programming, and provides a visual example with a network diagram.
Covered · First page introduces the transportation problem, shows a three-source three-destination network with route costs, and states the minimization objective.
Covered · Page transition from the network example to the assumptions list.
Covered · Second page lists four assumptions; the speaker explains balance of supply and demand and begins the second assumption before the clip ends.
Covered · Explaining Assumption ②: Goods can be transported conveniently from all supply points to all destinations.
Covered · Explaining Assumption ③, and illustrating with the example that the unit transportation cost is known.
Covered · Explaining Assumption ④: Route cost is directly proportional to the quantity shipped, illustrated intuitively with an upward arrow.
Covered · Explaining Assumption ⑤: The objective is to minimize the overall total transportation cost, distinguishing between the entire organization and individual supply or distribution centers.
Covered · Page transition, no new mathematical content.
Covered · Entering 'Existence of feasible solution', stating that a feasible solution exists when Total Demand equals Total Supply.
Covered · Listing transportation problem types: balanced and unbalanced, and emphasizing the need to first check whether demand equals supply.
Covered · The segment ends still on the 'Types of Transportation Problems' page, with no new identifiable mathematical content.
Covered · Explaining the definitions of balanced and unbalanced transportation problems and their conversion methods.
Covered · Detailed explanation and construction of the transportation problem in tabular (matrix) form.
Covered · List five methods for finding an initial basic feasible solution.
Covered · Introduction to methods for finding initial basic feasible solution.
Covered · Introduction to optimality test methods.
Covered · Explanation and example of degeneracy in transportation problems.
Covered · The entire clip covers the definition of degeneracy, the condition m plus n minus 1, an example of checking it, and the logical flow for solving transportation problems.
Reviewed subject paths
Continue with related videos in the same subject.
YouTube8:20
YouTube6:05
YouTube6:06