Zach's Math Zone · YouTube · 6:11
This 120-second clip introduces a transportation problem with 3 factories and 4 cities, shows the cost/supply/demand table, verifies that total supply equals total demand (), defines the objective as meeting demand while minimizing shipping cost, explains why the Northwest Corner Method starts at the top-left cell, and demonstrates the first allocation of 35 units from Factory 1 to City 1 before ending mid-solution. This video segment demonstrates the initial steps of solving a balanced transportation problem using the Northwest Corner Method. Starting from the top-left cell, the instructor allocates supplies to meet demands sequentially, updating the remaining supply and demand values and crossing out exhausted rows and columns. The clip covers the complete fulfillment of City 1 and City 2, illustrating the core mechanics of the algorithm. This 120-second whiteboard segment continues a transportation-problem solution using the Northwest Corner Method. It completes the City 3 column by allocating 20 units from Factory 2 and 10 units from Factory 3, then moves to City 4, skips the exhausted Factory 2 / City 4 cell, and assigns the final 30 units from Factory 3 to City 4. After the allocation table is complete, the narrator explains how to compute total shipping cost by multiplying each allocated quantity by its unit cost and summing the results, writing the expression . The clip ends before the final numerical total is evaluated. This video segment demonstrates the final step of solving a transportation problem using the Northwest Corner Method. It shows a completed allocation table and calculates the total transportation cost by multiplying the allocated quantities by their respective unit costs, resulting in a final cost of $1,180.
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.
The clip opens by naming the topic: solving a transportation problem with the Northwest Corner Method. On screen, a table lays out 3 factories as rows, 4 cities as columns, unit shipping costs inside, a Supply column on the right, and a Demand row at the bottom.
The presenter reads the marginal totals from the table. Factory supplies are 35, 50, and 40; city demands are 45, 20, 30, and 30. These values define how much each source can send and how much each destination must receive.
Next, the video checks whether the model is balanced. Adding the supply column gives , and adding the demand row gives . Because the two totals match, the speaker identifies this as a balanced transportation problem.
The objective is then stated in words: satisfy every city's demand while minimizing total shipping cost. The interior dollar amounts are interpreted as per-unit costs for shipping from a particular factory to a particular city.
To explain the method name, the presenter draws a compass and points to the northwest direction. This visual analogy translates directly to the table geometry: northwest means the upper-left corner, so the algorithm begins in the top-left cell.
The first worked step applies that rule to the example. The top-left cell is the Factory 1 to City 1 route, whose printed unit cost is $8. City 1 needs 45 units, but Factory 1 only has 35 available, so the clip assigns all 35 units from Factory 1 to City 1 and writes 35 into that cell.
The segment ends while the speaker is still explaining the consequence of using up Factory 1's supply, before showing the updated remaining demand or the next move in the Northwest Corner Method.
The video presents a transportation problem tableau with three factories and four cities. The goal is to find an initial feasible shipping plan using the Northwest Corner Method. We begin at the top-left cell, representing shipments from Factory 1 to City 1.
Factory 1 has a supply of 35 units, while City 1 requires 45 units. Following the method, we allocate the maximum possible amount, which is the minimum of supply and demand: . We record 35 in the cell and cross out Factory 1's supply, as it is now exhausted.
City 1's demand is reduced by the allocated amount: . Since there is still unmet demand, we move down to the next available cell in the same column, which corresponds to Factory 2 supplying City 1.
Factory 2 has an initial supply of 50 units. We allocate the remaining demand of 10 units from Factory 2 to City 1. We write 10 in the cell and update Factory 2's remaining supply to . City 1's demand is now fully satisfied.
Because City 1's demand is met, we cross out the remaining empty cell in its column (Factory 3 to City 1). Similarly, because Factory 1's supply was exhausted earlier, we cross out all remaining cells in its row (Factory 1 to Cities 2, 3, and 4).
With the first column and row resolved, we move to the next available cell in the tableau, which is Factory 2 supplying City 2. City 2 has a total demand of 20 units.
Factory 2 currently has 40 units of supply remaining. We allocate the full demand of 20 units from Factory 2 to City 2. We record 20 in the cell and reduce Factory 2's supply to .
City 2's demand is now completely met. We cross out the remaining cell in City 2's column (Factory 3 to City 2). The clip ends here, with Factory 2 having 20 units left to distribute to Cities 3 and 4.
The segment opens with the transportation tableau already partly filled. The narrator states that the current column is finished and the method advances to the next column, City 3, selecting the first available cell there.
The City 3 demand is read directly from the table as 30. Because Factory 2 still has 20 units of supply remaining, the Northwest Corner rule allocates the smaller of remaining supply and remaining demand to the active cell, giving .
That allocation exhausts Factory 2, so its remaining supply is crossed out. At the same time, City 3's demand is reduced from 30 to 10, showing that the column is not yet complete.
Since demand remains in the same column but the current row is exhausted, the procedure moves downward to the next available row, Factory 3. This is the visual cue that distinguishes row exhaustion from column completion.
Factory 3 begins with 40 units of supply. To satisfy the remaining City 3 demand of 10, the method allocates , which reduces Factory 3's supply to 30 and completes City 3 demand entirely.
With City 3 finished, the algorithm shifts right to the next column, City 4. The first cell in that column is Factory 2 / City 4, but that cell is not usable because Factory 2 supply was already exhausted earlier.
The narrator therefore crosses out Factory 2 / City 4 and proceeds to the last active cell, Factory 3 / City 4. City 4 demand is 30, and Factory 3 also has exactly 30 units left, so the final allocation is .
At this point the allocation table is complete. The occupied cells are 35 from Factory 1 to City 1, 10 from Factory 2 to City 1, 20 from Factory 2 to City 2, 20 from Factory 2 to City 3, 10 from Factory 3 to City 3, and 30 from Factory 3 to City 4.
The lesson then turns from feasibility to objective evaluation. The narrator explains that total shipping cost is computed by taking each allocated quantity, multiplying it by the unit shipping cost in the same cell, and adding all such products.
Applying that rule to the displayed solution produces the written expression TOTAL COST = . Each term corresponds to one occupied cell in the final Northwest Corner allocation.
The clip ends as the narrator begins to say that entering the expression into a calculator gives the final value, but the numerical total itself is not shown within this segment.
We have successfully applied the Northwest Corner Method to find an initial basic feasible solution for our transportation problem. The table now displays the allocated quantities for each factory-city route, alongside their corresponding unit costs.
To evaluate this solution, we calculate the total transportation cost. This is done by multiplying each allocated quantity by its unit cost and summing these products across all active routes.
Performing the arithmetic: 35 times $8, plus 10 times $9, plus 20 times $12, plus 20 times $13, plus 10 times $16, plus 30 times $5. Adding these values together gives us a total cost of $1,180.
This $1,180 represents the total cost of the current feasible solution obtained through the Northwest Corner Method.
The video represents a transportation problem as a matrix-like table. Rows are factories (sources), columns are cities (destinations), the rightmost column lists each factory's supply, the bottom row lists each city's demand, and the interior cells list unit shipping costs for each factory-city pair.
A transportation problem is balanced when total supply equals total demand. In the example, total supply is and total demand is , so the problem is balanced.
The goal is to meet every city's demand while minimizing total shipping cost. The numbers inside the table are interpreted as dollars per unit shipped along each route.
The speaker uses a compass analogy: northwest corresponds to the upper-left direction. Therefore, the method starts in the top-left cell of the transportation table.
Starting at the top-left cell (Factory 1, City 1), the method assigns as much as possible from the current factory to the current city. Since Factory 1 has supply 35 and City 1 has demand 45, the first allocation is 35 units.
A heuristic for finding an initial basic feasible solution in transportation problems. It starts at the top-left (northwest) cell, allocates , and moves right if supply is exhausted or down if demand is exhausted.
At cell (Factory 1, City 1), supply is 35 and demand is 45. Allocate . Factory 1's supply becomes 0 (crossed out). City 1's remaining demand becomes .
Since City 1 still needs 10 units, move down to cell (Factory 2, City 1). Factory 2 has 50 units. Allocate 10. Factory 2's remaining supply becomes . City 1's demand is now 0.
When a row's supply or column's demand reaches zero, all remaining cells in that row/column are crossed out. Here, Factory 1's row and City 1's column are fully crossed out after their respective resources are depleted.
Move to the next available cell, (Factory 2, City 2). City 2 demands 20 units. Factory 2 has 40 units left. Allocate 20. Factory 2's remaining supply drops to 20. City 2's demand is met, so its column is crossed out.
After finishing the previous column, the method moves to the next column and chooses the first available cell. In this clip, that means entering the City 3 column and preparing to satisfy its demand of 30 units.
Factory 2 has 20 units of remaining supply, while City 3 needs 30. The Northwest Corner rule assigns the smaller amount, so 20 units are placed in the Factory 2 / City 3 cell. This exhausts Factory 2 and leaves 10 units of City 3 demand unmet.
Because Factory 2 supply becomes zero but City 3 still needs 10 units, the algorithm does not stop or move right. Instead, it moves downward within the same column to the next available row, Factory 3.
Factory 3 has 40 units available and City 3 still needs 10. The method assigns 10 units to the Factory 3 / City 3 cell, which completes City 3 demand and reduces Factory 3 supply to 30.
Once City 3 demand reaches zero, the column is eliminated and the procedure advances to the next column, City 4, even though Factory 3 still has supply remaining.
When entering City 4, the Factory 2 / City 4 cell is crossed out because Factory 2 supply was already used up. Only cells with both remaining row supply and remaining column demand can receive allocations.
City 4 requires 30 units and Factory 3 has exactly 30 units left. The last active cell therefore receives 30 units, completing the feasible Northwest Corner solution.
The full allocation shown by the end of the procedure is 35 from Factory 1 to City 1, 10 from Factory 2 to City 1, 20 from Factory 2 to City 2, 20 from Factory 2 to City 3, 10 from Factory 3 to City 3, and 30 from Factory 3 to City 4.
To evaluate the transportation solution, multiply each allocated quantity by the unit shipping cost in the same cell and sum all products over the occupied cells.
Using the allocated cells and their unit costs, the written objective expression is 35 times 8 plus 10 times 9 plus 20 times 12 plus 20 times 13 plus 10 times 16 plus 30 times 5. The clip ends before the final numeric total is computed.
After finding an initial feasible solution (such as with the Northwest Corner Method), the total cost is evaluated by summing the product of the allocated quantity and the unit cost for every occupied cell in the transportation tableau. Formula: Total Cost = (Allocation Unit Cost).
The Northwest Corner Method is a heuristic used to generate an initial basic feasible solution for a transportation problem. It starts allocating from the top-left (northwest) cell of the cost matrix, satisfying supply and demand constraints sequentially without considering the unit costs during the allocation phase.
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
Rows are labeled Factory 1, Factory 2, Factory 3.
The speaker says there are three factories that produce some good.
Factory i
Production source or origin in the transportation table.
\{1,2,3\}
Columns are labeled City 1, City 2, City 3, City 4.
The speaker says there are four cities that have a demand for that good.
City j
Destination or demand point in the transportation table.
\{1,2,3,4\}
Rightmost column header is Supply with values 35, 50, 40.
Factory 1 has a total supply of 35; Factory 2 makes 50 units; Factory 3 makes 40 units.
Supply_i
Total units available from factory i.
Units of goods
Bottom row header is Demand with values 45, 20, 30, 30.
City 1 has a total demand of 45 units; City 2 has 20; City 3 has 30; City 4 has 30.
Demand_j
Total units required by city j.
Units of goods
Interior cells contain dollar amounts such as $8, $6, $10, $9, $12, $13, $7, $14, $16, $5.
Within each of these cells in the table, I've shown the shipping costs per unit.
Cost_{ij}
Shipping cost per unit from factory i to city j.
Dollars per unit
The speaker writes 125 beside the Supply column after circling 35, 50, 40.
If you add up these values, that turns out to be 125.
Supply_i
Total supply across all factories.
Units of goods
The speaker writes 125 below the Demand row after circling 45, 20, 30, 30.
The total demand among all four cities is also 125.
Demand_j
Total demand across all cities.
Units of goods
The top-left cell (Factory 1, City 1) is circled and then 35 is written inside it.
This factory has a supply of 35, so we can use up all 35 of those units.
The clip ends before the method states the full allocation rule or updates remaining demand.
Quantity shipped from Factory 1 to City 1 under the Northwest Corner Method.
Units of goods
Row label 'Factory 1' in the transportation table.
Factory 1
First supply source with an initial capacity of 35 units.
Supply source
Row label 'Factory 2' in the transportation table.
Factory 2
Second supply source with an initial capacity of 50 units.
Supply source
Row label 'Factory 3' in the transportation table.
Factory 3
Third supply source with an initial capacity of 40 units.
Supply source
Column label 'City 1' in the transportation table.
City 1
First demand destination requiring 45 units.
Demand destination
In this video, I will explain how to solve the transportation problem using the Northwest Corner Method.
A table shows factories as rows, cities as columns, interior unit costs, a Supply column, and a Demand row.
The video introduces a transportation problem as a table-based model with multiple production sources and multiple destinations. Rows represent factories, columns represent cities, the rightmost column gives each factory's available supply, the bottom row gives each city's required demand, and the interior cells give unit shipping costs between each factory-city pair.
There are m sources and n destinations.
Each source has a supply amount.
Each destination has a demand amount.
Each source-destination pair has a unit shipping cost.
So this is known as a balanced transportation problem.
The speaker sums the Supply column to 125 and the Demand row to 125.
A transportation problem is called balanced when total supply equals total demand. In the example, total supply is and total demand is , so the model is balanced.
All supplies and demands are nonnegative.
Equality is checked after summing all row supplies and all column demands.
We want to meet the demand of each city, but we want to minimize the shipping costs.
Interior cells contain per-unit costs such as $8 from Factory 1 to City 1 and $6 from Factory 1 to City 2.
The goal stated in the clip is to satisfy every city's demand while minimizing total shipping cost. The table entries are interpreted as costs per unit shipped from a given factory to a given city.
Demand must be met at each destination.
Costs are linear per unit in the displayed setup.
If you imagine that we draw a compass ... northwest would be in this direction ... pointing to the top left.
A compass with N, S, E, W is drawn, and an arrow indicates the northwest direction.
The speaker explains the name by comparing the table to a compass. Northwest corresponds to the upper-left direction, so the method starts at the top-left cell of the transportation table.
The table is oriented with rows increasing downward and columns increasing rightward.
When we use this method, we're always going to start with the cell in the top left corner of the table.
The cell (Factory 1, City 1), containing $8, is circled.
The first step of the Northwest Corner Method is to begin in the top-left cell of the transportation table. In this example, that is the Factory 1 to City 1 cell with unit cost $8.
Use the current active subtable's top-left cell.
The method proceeds cell by cell from that starting position.
City 1 has a total demand of 45 units. So we're going to fulfill as much of that demand as possible in this cell right here based on whatever the supply is for this factory.
The speaker circles City 1 demand 45, Factory 1 supply 35, and writes 35 into the (Factory 1, City 1) cell.
The clip ends before the general min(supply, demand) rule is fully stated or the remaining demand update is shown.
At the starting cell, the video allocates as much as possible from the chosen factory to the chosen city, limited by that factory's available supply. Here Factory 1 has supply 35 and City 1 needs 45, so all 35 units from Factory 1 are assigned to City 1.
Compare the current row supply and current column demand.
Assign the smaller available amount to the current cell.
This clip only demonstrates the case where supply is smaller than demand.
The speaker explains the process of fulfilling demand by moving down or right based on remaining supply and demand, which is characteristic of the Northwest Corner Method.
A heuristic algorithm used to find an initial basic feasible solution for a transportation problem. It starts at the top-left (northwest) cell of the transportation tableau and allocates as much as possible to that cell, then moves either down or right depending on whether supply or demand is exhausted, repeating until all supplies and demands are met.
Total supply must equal total demand (balanced problem).
Start allocation at the top-left cell.
Allocate min(remaining supply, remaining demand) to the current cell.
Move right if supply is exhausted; move down if demand is exhausted.
If both are exhausted simultaneously, move right (or down) and allocate 0 to the next cell to maintain degeneracy rules.
The narrator says, "So now we're done with this column, we'll move on to the next column, so city three."
The active focus shifts from the completed City 2 column to the first available cell in the City 3 column.
When a column's demand has been fully satisfied, the method advances to the next column and selects the next available cell in that column. In this clip, after finishing City 2, the process moves to City 3 and identifies the first usable cell there.
The current column's demand is already met.
The next column still has unmet demand.
The chosen cell must not already be eliminated by exhausted supply or demand.
The narrator says Factory 2 has 20 supply left, uses all of it, then notes there is still 10 demand left and they need to move down to the next cell.
The Factory 2 / City 3 cell receives 20, the Factory 2 supply is exhausted, and the City 3 demand is reduced from 30 to 10.
If the selected cell consumes all remaining supply in the current row but the column demand is not yet met, the algorithm eliminates that row and moves down to the next available row in the same column. Here, allocating 20 from Factory 2 to City 3 exhausts Factory 2, leaving 10 units of City 3 demand to be satisfied from Factory 3.
The current row's remaining supply is less than the current column's remaining demand.
After allocation, the row supply becomes zero.
The column demand remains positive.
The narrator says Factory 3 has supply 40, takes 10 from there, reduces supply to 30, puts 10 in the cell, and then states that City 3 is now done so they move to the next column, City 4.
The Factory 3 / City 3 cell receives 10, the City 3 demand becomes fully satisfied, and the focus shifts to City 4.
If the selected cell consumes exactly the remaining demand in the current column while supply remains in the row, the algorithm eliminates that column and moves right to the next column. In this clip, allocating 10 from Factory 3 to City 3 completes City 3 demand, so the process advances to City 4 while Factory 3 still has 30 units left.
The current column's remaining demand is less than or equal to the current row's remaining supply.
After allocation, the column demand becomes zero.
The row supply may remain positive.
The narrator says, "We can see that we've already exhausted the supply of factory two, so we actually just need to cross this cell out, and then we'll move to this very last cell."
The Factory 2 / City 4 cell is crossed out before attention moves to Factory 3 / City 4.
When moving into a new column, any cell in a row whose supply has already been used up is not eligible for allocation. The method crosses out that cell and proceeds to the next available cell in the column. Here, Factory 2 / City 4 is skipped because Factory 2 supply was exhausted earlier.
The row supply is already zero.
The cell lies in the currently active column.
Another row in the same column still has available supply.
The narrator says the total demand for City 4 is 30 and that they can meet it using the remaining supply, putting 30 units in the last cell.
The Factory 3 / City 4 cell receives 30, and the remaining Factory 3 supply becomes 0.
At the last active cell, the remaining supply is assigned to the remaining demand. In this example, Factory 3 still has 30 units and City 4 needs 30 units, so the final allocation is 30 from Factory 3 to City 4, completing the feasible Northwest Corner solution.
Only one active cell remains.
The remaining row supply equals the remaining column demand in this example.
All previous rows and columns have been eliminated or satisfied.
The total supply ... turns out to be 125 ... the total demand ... is also 125. So this is known as a balanced transportation problem.
125 is written next to the Supply column and again below the Demand row.
For the displayed 3-by-4 example, total supply equals total demand, both being 125, so the transportation problem is balanced.
Supply values are 35, 50, 40.
Demand values are 45, 20, 30, 30.
For this specific example table.
When we use this method, we're always going to start with the cell in the top left corner of the table.
The top-left interior cell is circled.
Using the Northwest Corner Method, the initial allocation is made in the top-left cell of the transportation table.
The transportation table is arranged with sources as rows and destinations as columns.
For the method as introduced in this clip.
The narrator states that City 3 has a total demand of 30.
The Demand row under City 3 shows 30.
The destination City 3 requires 30 units in this transportation table.
The table shown is the active transportation problem instance.
The bottom row labeled Demand lists destination requirements.
For the specific City 3 column in the displayed table.
The narrator says Factory 2 has 20 supply left.
The Factory 2 Supply entry shows 50 crossed out, 40 crossed out, and 20 written as the remaining amount.
At the moment the algorithm enters the City 3 column, Factory 2 still has 20 units available.
Earlier allocations from Factory 2 to City 1 and City 2 have already been made.
The Supply column tracks remaining capacity after each allocation.
For Factory 2 at the start of the City 3 allocation step.
The narrator says a total of 20 of the 30 demand has been met, so the demand is reduced by 20 and becomes 10.
The City 3 demand entry changes from 30 to 10 after writing 20 in the Factory 2 / City 3 cell.
The residual demand at City 3 after the Factory 2 allocation is 10 units.
City 3 initial demand is 30.
The allocation is made from Factory 2 to City 3.
For City 3 immediately after the Factory 2 / City 3 allocation.
The narrator says Factory 3 has a supply of 40, they take 10 from there, and reduce the supply to 30.
The Factory 3 Supply entry changes from 40 to 30 when 10 is placed in the Factory 3 / City 3 cell.
After allocating 10 units from Factory 3 to City 3, Factory 3's remaining supply is 30 units.
Factory 3 initial supply is 40.
The allocation is made.
For Factory 3 immediately after the Factory 3 / City 3 allocation.
The narrator says the total demand for City 4 is 30.
The Demand row under City 4 shows 30.
The destination City 4 requires 30 units in this transportation table.
The table shown is the active transportation problem instance.
The bottom row labeled Demand lists destination requirements.
For the specific City 4 column in the displayed table.
The narrator says they will use the remaining supply and put 30 units in this cell to meet City 4 demand.
The Factory 3 / City 4 cell receives 30, and the remaining Factory 3 supply becomes 0.
In the completed Northwest Corner solution, .
Factory 3 has 30 units remaining after serving City 3.
City 4 still needs 30 units.
Factory 2 supply is exhausted, so Factory 2 / City 4 is skipped.
For the last active cell in the displayed solution.
The board writes TOTAL COST: 35($8)+10($9)+20($12)+20($13)+10($16)+30($5).
The narrator reads each allocated cell and multiplies its quantity by the unit shipping price.
The final numeric total is not shown within this clip.
The total shipping cost for the allocation shown is expressed as 35 times 8 plus 10 times 9 plus 20 times 12 plus 20 times 13 plus 10 times 16 plus 30 times 5.
The allocated cells are (1,1), (2,1), (2,2), (2,3), (3,3), and (3,4).
The corresponding unit costs are 8, 9, 12, 13, 16, and 5.
For the specific completed allocation table shown in the clip.
If you add up these values, that turns out to be 125 ... the total demand ... is also 125.
The Supply entries 35, 50, 40 are circled and 125 is written; the Demand entries 45, 20, 30, 30 are circled and 125 is written.
Add the three factory supplies shown in the Supply column.
Direct summation of the displayed supply values.
Add the four city demands shown in the Demand row.
Direct summation of the displayed demand values.
Compare total supply with total demand.
Equality of the two totals identifies the model as balanced.
Total supply equals total demand, so the example is a balanced transportation problem.
City 1 has a total demand of 45 units ... this factory has a supply of 35, so we can use up all 35 of those units.
The (Factory 1, City 1) cell is selected and 35 is written into it.
The clip stops before the remaining demand for City 1 is updated or the next move is explained.
Begin in the top-left cell of the transportation table.
Stated rule of the Northwest Corner Method in the clip.
Read the row supply and column demand relevant to the starting cell.
Values are explicitly shown in the table and spoken aloud.
Allocate all available supply from Factory 1 to City 1 because the supply is smaller than the demand.
The speaker says to fulfill as much demand as possible based on the factory's supply.
The first Northwest Corner allocation in this example is 35 units from Factory 1 to City 1.
Speaker narrates crossing out 35, updating demand to 10, moving down to Factory 2, allocating 10, updating supply to 40, and crossing out remaining cells in City 1 and Factory 1.
Visual updates of numbers and crossing out of cells in the first column and first row.
Allocate the maximum possible amount from Factory 1 to City 1.
Northwest Corner Method rule: allocate min(supply, demand).
Factory 1's supply is completely exhausted.
Subtract allocated amount from initial supply.
Update remaining demand for City 1.
Subtract allocated amount from initial demand.
Move down to Factory 2 and allocate to satisfy the remaining demand of City 1.
Since supply of Factory 1 is 0, move down. Allocate min(new supply, remaining demand).
Update remaining supply for Factory 2.
Subtract allocated amount from Factory 2's supply.
City 1's demand is now fully satisfied.
Remaining demand becomes zero.
Cross out the remaining cell in City 1's column.
Demand for City 1 is met, so no further allocations can be made to this column.
Cross out the remaining cells in Factory 1's row.
Supply for Factory 1 is exhausted, so no further allocations can be made from this row.
The first column (City 1) and first row (Factory 1) are fully resolved, leaving Factory 2 with 40 units of supply to distribute to Cities 2, 3, and 4.
Speaker narrates moving to City 2, allocating 20 from Factory 2, updating supply to 20, and crossing out remaining cells in City 2.
Visual updates of numbers and crossing out of cells in the second column.
Move to the next available cell (Factory 2, City 2) and allocate to satisfy City 2's demand.
Northwest Corner Method rule: allocate min(remaining supply, demand).
Update remaining supply for Factory 2.
Subtract allocated amount from Factory 2's current supply.
City 2's demand is fully satisfied.
Remaining demand becomes zero.
Cross out the remaining cell in City 2's column.
Demand for City 2 is met, so no further allocations can be made to this column.
The second column (City 2) is resolved, leaving Factory 2 with 20 units of supply and Cities 3 and 4 with unmet demands.
The narrator explains that City 3 demand is 30, Factory 2 has 20 supply left, they use all of it, write 20 in the cell, and reduce City 3 demand to 10.
The Factory 2 / City 3 cell is filled with 20; Factory 2 supply goes from 20 to 0; City 3 demand goes from 30 to 10.
Read the remaining demand for City 3 from the Demand row.
The table explicitly shows 30 under City 3, and the narrator states this value.
Read the remaining supply for Factory 2 before entering the City 3 column.
The Supply column for Factory 2 shows 20 after earlier allocations, and the narrator says Factory 2 has 20 supply left.
Allocate the smaller of remaining supply and remaining demand to the current Northwest Corner cell.
This is the Northwest Corner rule demonstrated by the narrator when they say to use up all remaining supply from Factory 2.
Subtract the allocated amount from Factory 2's remaining supply.
The board crosses out the Factory 2 supply value after placing 20 in the cell.
Subtract the allocated amount from City 3's remaining demand.
The narrator explicitly says the demand is reduced by 20 and becomes 10, and the table updates accordingly.
After the first City 3 step, 20 units are shipped from Factory 2 to City 3, Factory 2 is exhausted, and City 3 still needs 10 units.
The narrator says there is still 10 demand left, so they move down to the next cell and use Factory 3, taking 10 from its supply of 40 and reducing supply to 30.
The Factory 3 / City 3 cell is filled with 10; Factory 3 supply goes from 40 to 30; City 3 demand is completed.
Carry forward the unmet demand at City 3 from the previous step.
The previous derivation ended with City 3 demand reduced to 10, and the narrator repeats that 10 demand remains.
Read Factory 3's available supply before this allocation.
The Supply column for Factory 3 shows 40, and the narrator states this value.
Allocate the smaller of remaining supply and remaining demand to the new active cell.
This follows the same Northwest Corner rule used by the narrator when they say to take 10 from Factory 3.
Subtract the allocated amount from Factory 3's supply.
The board updates Factory 3's remaining supply to 30, and the narrator says they reduce the supply to 30.
Subtract the allocated amount from City 3's remaining demand.
The narrator states that the total demand has now been met, so City 3 is done.
After the second City 3 step, 10 units are shipped from Factory 3 to City 3, City 3 demand is fully satisfied, and Factory 3 retains 30 units of supply.
The narrator says City 3 is done, so they move to City 4; Factory 2 supply is exhausted so that cell is crossed out; City 4 demand is 30 and is met using the remaining supply in the last cell.
The Factory 2 / City 4 cell is crossed out, then the Factory 3 / City 4 cell receives 30 and Factory 3 supply becomes 0.
Advance to the next column once City 3 demand is fully satisfied.
The narrator explicitly says that since City 3 is done, they move to the next column, City 4.
Skip the Factory 2 / City 4 cell because Factory 2 supply is already exhausted.
The narrator says they have already exhausted the supply of Factory 2 and crosses out that cell.
Read the remaining demand for City 4 from the Demand row.
The table shows 30 under City 4, and the narrator states the total demand for City 4 is 30.
Use the remaining supply at Factory 3 after the City 3 allocation.
The previous derivation ended with Factory 3 having 30 units left, and the narrator refers to the remaining supply.
Allocate the smaller of remaining supply and remaining demand to the final active cell.
This matches the narrator's instruction to put 30 units in the last cell to meet City 4 demand.
Subtract the allocated amount from Factory 3's remaining supply.
The board updates Factory 3's supply to 0 after placing 30 in the Factory 3 / City 4 cell.
Subtract the allocated amount from City 4's demand.
The narrator says this meets the demand for City 4, and the table marks the column complete.
The final active allocation is 30 units from Factory 3 to City 4, which exhausts both Factory 3 supply and City 4 demand and completes the Northwest Corner solution.
The narrator explains that total shipping cost is found by multiplying the units in each allocated cell by the unit shipping price and adding the results.
The board writes TOTAL COST: 35($8)+10($9)+20($12)+20($13)+10($16)+30($5).
The clip ends before the final arithmetic total is written or spoken.
Identify every cell that received a nonzero allocation in the completed table.
These are exactly the cells visibly filled in the final allocation grid.
Multiply the allocation in Factory 1 / City 1 by its unit cost.
The narrator reads this first allocated cell and states 35 times 8.
Multiply the allocation in Factory 2 / City 1 by its unit cost.
The narrator identifies the next allocated cell as 10 units with a shipping cost of $9 per unit.
Multiply the allocation in Factory 2 / City 2 by its unit cost.
The narrator reads the next allocated cell as 20 units times $12.
Multiply the allocation in Factory 2 / City 3 by its unit cost.
The narrator reads the next allocated cell as 20 times $13.
Multiply the allocation in Factory 3 / City 3 by its unit cost.
The narrator reads the next allocated cell as 10 times $16.
Multiply the allocation in Factory 3 / City 4 by its unit cost.
The narrator reads the last allocated cell as 30 times $5.
Add all six products to form the objective-value expression.
This is exactly what the narrator describes and what is written on the board.
The total shipping cost for the displayed Northwest Corner solution is represented by the sum ; the final numeric evaluation is not shown in this clip.
The step-by-step arithmetic is shown: 35($8) + 10($9) + 20($12) + 20($13) + 10($16) + 30($5) = $1,180.
Multiply each allocated quantity by its corresponding unit cost based on the filled cells in the transportation table.
Definition of total cost in a transportation problem.
Compute the individual products for each route.
Arithmetic multiplication.
Sum the individual route costs to get the total cost.
Arithmetic addition.
The total transportation cost for the given allocation is $1,180.
A 3-by-4 transportation table is shown with factories, cities, unit costs, supply, and demand.
Let's say we have three factories ... and four cities ... Factory 1 has a total supply of 35 ... City 1 has a total demand of 45 units.
Only the first allocation step is completed within the clip; the rest of the Northwest Corner solution is not shown.
Given three factories and four cities with unit shipping costs, supplies, and demands, set up the transportation problem and begin solving it by the Northwest Corner Method.
Factories: Factory 1, Factory 2, Factory 3.
Cities: City 1, City 2, City 3, City 4.
Unit costs: Factory 1 row = $8, $6, $10, $9; Factory 2 row = $9, $12, $13, $7; Factory 3 row = $14, $9, $16, $5.
Supplies: 35, 50, 40.
Demands: 45, 20, 30, 30.
Identify the model structure, check whether it is balanced, and make the first Northwest Corner allocation.
Interpret the table layout as a transportation matrix.
Explicitly described by the speaker and visible in the diagram.
Sum the supplies.
Shown by circling the Supply column and writing 125.
Sum the demands.
Shown by circling the Demand row and writing 125.
Conclude the example is balanced.
Stated directly in the audio.
Apply the Northwest Corner starting rule.
Stated directly in the audio and marked visually.
Allocate 35 units from Factory 1 to City 1.
The speaker says to use up all 35 units of Factory 1's supply toward City 1's demand.
The example is a balanced transportation problem, and the first Northwest Corner allocation is 35 units from Factory 1 to City 1.
Balance is verified by comparing total supply 125 with total demand 125; the first allocation is verified by comparing supply 35 and demand 45 and assigning the smaller amount, 35.
A 3x4 transportation table with specific supply and demand values.
Find an initial basic feasible solution for a transportation problem with 3 factories (supplies: 35, 50, 40) and 4 cities (demands: 45, 20, 30, 30) using the Northwest Corner Method.
Factory 1 supply = 35
Factory 2 supply = 50
Factory 3 supply = 40
City 1 demand = 45
City 2 demand = 20
City 3 demand = 30
City 4 demand = 30
Determine the allocation amounts for each factory-city pair starting from the northwest corner.
Fulfill City 1's demand of 45 using all of Factory 1's supply (35) and 10 units from Factory 2.
Northwest Corner Method allocation rules.
Fulfill City 2's demand of 20 using the remaining supply of Factory 2.
Northwest Corner Method allocation rules.
Partial allocations found: , , . Factory 2 has 20 units remaining. The process continues for Cities 3 and 4.
Total allocated so far equals the sum of fulfilled demands (). Total supply used equals . Balance is maintained.
The narrator walks through the remaining steps of a transportation problem using the Northwest Corner Method, then computes the total shipping cost expression.
The board shows a 3-by-4 transportation table with factories, cities, supplies, demands, unit costs, allocations, and a TOTAL COST expression.
The final numerical total cost is not reached within the clip.
Some pre-existing allocations in City 1 and City 2 are only partially explained because they were completed before this segment.
Continue solving the displayed transportation problem from the City 3 column onward using the Northwest Corner Method, then write the total shipping cost for the resulting allocation.
Factories: Factory 1, Factory 2, Factory 3.
Cities: City 1, City 2, City 3, City 4.
Initial supplies shown in the table: Factory , Factory , Factory .
Initial demands shown in the table: City , City , City , City .
Unit costs visible in the table include $8, $9, $12, $13, $16, and $5 for the allocated cells used later.
Earlier allocations already present before this clip include 35 from Factory 1 to City 1, 10 from Factory 2 to City 1, and 20 from Factory 2 to City 2.
Determine the remaining allocations for City 3 and City 4.；State the completed allocation pattern.；Write the total shipping cost expression for the full solution.
Enter the City 3 column, see that City 3 needs 30 units, and allocate all 20 remaining units from Factory 2 to City 3.
The narrator says Factory 2 has 20 supply left and uses all of it in the next available cell.
Reduce City 3 demand from 30 to 10 after receiving 20 units.
The board updates the City 3 demand entry and the narrator explicitly states the reduction.
Move down to Factory 3 in the same column and allocate 10 units from Factory 3 to City 3 to satisfy the remaining demand.
The narrator says there is still 10 demand left and they meet it using Factory 3.
Reduce Factory 3 supply from 40 to 30 after sending 10 units to City 3.
The board updates the Factory 3 supply entry and the narrator states the reduction.
When moving to City 4, skip the Factory 2 / City 4 cell because Factory 2 supply is already exhausted.
The narrator explicitly says they have already exhausted the supply of Factory 2 and crosses out that cell.
Allocate the remaining 30 units from Factory 3 to City 4 to satisfy City 4's demand of 30.
The narrator says the total demand for City 4 is 30 and they use the remaining supply in the last cell.
Multiply each allocated quantity by its unit shipping cost and add all terms to form the total cost expression.
This is the procedure stated by the narrator and written on the board.
The completed allocation shown in this clip is , , , , , and , with total cost expressed as .
Column sums match the demands 45, 20, 30, and 30, and row sums match the supplies 35, 50, and 40 in the displayed table; however, the clip does not compute the final numeric cost value.
A 3x4 transportation table with factories, cities, supplies, demands, unit costs, and allocated quantities is shown.
Calculate the total cost of the transportation plan derived from the Northwest Corner Method for the given factories and cities.
Factory 1 Supply: 35
Factory 2 Supply: 26
Factory 3 Supply: 38
City 1 Demand: 45
City 2 Demand: 20
City 3 Demand: 10
City 4 Demand: 30
Allocations: F1-C1: 35, F2-C1: 10, F2-C2: 20, F2-C3: 20, F3-C3: 10, F3-C4: 30
Unit Costs: F1-C1: $8, F2-C1: $9, F2-C2: $12, F2-C3: $13, F3-C3: $16, F3-C4: $5
Find the total transportation cost.
Set up the total cost equation by multiplying allocations by unit costs.
Total cost formula.
Evaluate the expression to find the final total cost.
Arithmetic calculation.
$1,180
The sum of the individual products () equals 1180.
A white grid on black background shows headers City 1 through City 4, Supply, Factory 1 through Factory 3, Demand, and interior dollar costs.
Light blue circles are drawn around the factory labels and then the city labels.
Transportation table
Factory labels
City labels
Supply column
Demand row
Unit cost cells
Factory labels are circled first.
City labels are circled next.
The numerical contents of the table remain unchanged during this interval.
The visual emphasis establishes that rows correspond to factories and columns correspond to cities.
The values 35, 50, 40 in the Supply column are circled one by one, then 45, 20, 30, 30 in the Demand row are circled one by one.
The speaker reads the supply and demand values aloud.
Supply values 35, 50, 40
Demand values 45, 20, 30, 30
Each supply value is circled in sequence.
Each demand value is circled in sequence.
The table structure and unit costs do not change.
The animation separates the marginal totals from the interior cost data.
A large oval encloses the Supply column values, and 125 is written to the right; then a large oval encloses the Demand row values, and 125 is written below.
Supply column
Demand row
Handwritten 125 annotations
Supply values are grouped and totaled as 125.
Demand values are grouped and totaled as 125.
Original row and column entries remain visible.
The visual grouping supports the conclusion that the problem is balanced.
A compass with N, S, E, W is drawn to the left of the table.
An arrow points to the upper-left direction, and the top-left cell of the table is circled.
Compass drawing
Direction labels N, S, E, W
Arrow to northwest
Top-left table cell
The compass is drawn.
A northwest arrow is added.
The top-left cell is highlighted.
The table values themselves do not change.
The compass maps the phrase Northwest Corner to the upper-left corner of the transportation table.
City 1 label and its demand 45 are circled, Factory 1 label and its supply 35 are circled, and 35 is written inside the (Factory 1, City 1) cell.
No update to remaining demand is shown before the clip ends.
City 1 header
Demand 45
Factory 1 label
Supply 35
Cell (Factory 1, City 1)
Handwritten 35
The relevant demand and supply are circled.
The number 35 is written into the top-left interior cell.
The printed unit cost $8 remains in the same cell.
The animation shows that the first shipment quantity assigned by the method is 35 units from Factory 1 to City 1.
A static grid representing the transportation problem with rows for factories and columns for cities.
Grid with 3 rows (Factories) and 4 columns (Cities)
Supply column on the right
Demand row at the bottom
Compass rose on the left indicating North-West starting point
Numbers in cells are updated to reflect remaining supply and demand.
Cells are crossed out with an 'X' when their corresponding row supply or column demand is exhausted.
The structure of the grid remains constant.
The initial total supply (125) equals the initial total demand (125).
The visual updates directly demonstrate the step-by-step execution of the Northwest Corner Method, showing how allocations deplete supplies and satisfy demands sequentially.
A black background shows a hand-drawn compass rose on the left and a transportation table on the right with rows Factory 1, Factory 2, Factory 3 and columns City 1, City 2, City 3, City 4, Supply, plus a Demand row.
Several cells already contain allocations and crossed-out entries before the clip's new steps begin.
compass rose
transportation table
Factory 1 row
Factory 2 row
Factory 3 row
City 1 column
City 2 column
City 3 column
City 4 column
Supply column
Demand row
Attention shifts from the completed City 2 column to the first available cell in the City 3 column.
The overall table structure remains the same.
Previously written allocations in earlier columns remain visible.
The visual setup establishes a transportation problem in tableau form and indicates that the Northwest Corner procedure is already partway through the column-by-column allocation process.
The City 3 demand value 30 is circled, then the Factory 2 label is emphasized, then the Factory 2 / City 3 cell is filled with 20.
The Factory 2 supply entry is marked exhausted and the City 3 demand entry is reduced from 30 to 10.
City 3 demand entry
Factory 2 row label
Factory 2 / City 3 cell
Factory 2 supply entry
The number 20 is written into the Factory 2 / City 3 cell.
Factory 2's remaining supply is crossed out to indicate exhaustion.
City 3's demand is rewritten from 30 to 10.
The unit cost shown in the Factory 2 / City 3 cell remains $13.
Other columns and rows stay unchanged during this step.
The animation encodes the Northwest Corner rule visually: allocate min(remaining supply, remaining demand), then eliminate the exhausted row and update the residual column demand.
A downward arrow indicates movement from the exhausted Factory 2 row to the Factory 3 row within the City 3 column.
The Factory 3 / City 3 cell receives 10, and the Factory 3 supply entry changes from 40 to 30.
downward arrow
Factory 3 row label
Factory 3 / City 3 cell
Factory 3 supply entry
City 3 demand entry
The active cell moves down to Factory 3 / City 3.
The number 10 is written into that cell.
Factory 3 supply is reduced from 40 to 30.
City 3 demand is completed and the column is treated as done.
The unit cost in the Factory 3 / City 3 cell remains $16.
The table layout and other allocations remain fixed.
This visual sequence demonstrates the case where the column demand is smaller than the row supply: satisfy the column completely, keep the row active, and move right to the next column.
The focus moves to the City 4 column, the Factory 2 / City 4 cell is crossed out, and then the Factory 3 / City 4 cell is filled with 30.
The City 4 demand entry 30 is circled, and Factory 3's remaining supply becomes 0 after the final allocation.
City 4 column
Factory 2 / City 4 cell
Factory 3 / City 4 cell
City 4 demand entry
Factory 3 supply entry
The Factory 2 / City 4 cell is crossed out as unavailable.
The number 30 is written into the Factory 3 / City 4 cell.
Factory 3 supply is reduced from 30 to 0.
City 4 demand is satisfied and the solution is visually complete.
The unit cost in the Factory 3 / City 4 cell remains $5.
Earlier allocations in City 1, City 2, and City 3 remain unchanged.
The final visual step shows how an exhausted row is skipped and the last remaining supply is assigned to the last remaining demand, producing a basic feasible allocation pattern.
Below the table, the words TOTAL COST appear, followed by a left-to-right construction of a sum of products.
The completed written expression is TOTAL COST: 35($8)+10($9)+20($12)+20($13)+10($16)+30($5).
The final numeric evaluation is not written before the clip ends.
TOTAL COST label
allocated cells in the table
product terms in the sum
Each allocated cell is referenced in order.
One product term is appended after another until the full sum is visible.
The allocation table above remains unchanged while the cost expression is written.
Each product pairs one allocated quantity with the unit cost from the same cell.
The visual process converts the completed transportation allocation into the objective function value by summing quantity-times-cost terms over all occupied cells.
A static transportation table is displayed with a compass rose indicating North, South, East, West.
Compass rose
Transportation matrix
Total cost equation
The final answer '$1,180' is boxed in red.
The allocated quantities and unit costs in the table remain unchanged.
The visual layout demonstrates the final state of the Northwest Corner Method allocation and the subsequent cost calculation.
The speaker explains the Northwest Corner Method by position (top-left cell) rather than by choosing the cheapest cost cell.
The chosen starting cell contains $8 even though other cells in the table have lower costs such as $5, $6, or $7.
The video does not explicitly state this contrast; it is inferred from the demonstrated procedure.
One might think the method starts by choosing the lowest shipping cost in the table.
In this clip, the method is defined by table position: it starts at the top-left cell regardless of whether that cell has the smallest unit cost.
The narrator explicitly says that because Factory 2 supply is already exhausted, the Factory 2 / City 4 cell must be crossed out rather than used.
The Factory 2 / City 4 cell is visibly crossed out before the final allocation is made elsewhere.
One might think that when moving to a new column, the topmost cell in that column can always receive an allocation.
A cell is usable only if its row still has remaining supply and its column still has remaining demand. In this clip, Factory 2 / City 4 is skipped because Factory 2 supply was already exhausted.
The narrator continues after Factory 2 supply reaches zero because City 3 still has 10 demand left, and later continues after City 3 demand reaches zero because Factory 3 still has supply left for City 4.
The table updates show one side becoming zero while the other side remains positive, prompting a move down or right rather than termination.
A learner may think the procedure ends whenever any single supply or demand entry becomes zero.
The method ends only when all demands and supplies are satisfied. If a row is exhausted but the column still needs units, move down; if a column is satisfied but the row still has units, move right.
After summing supplies and demands, the speaker says this is known as a balanced transportation problem.
Both totals are written as 125.
A balanced transportation problem is the special case of a transportation problem in which total supply equals total demand.
The speaker moves from checking balance to stating the goal of meeting demand while minimizing shipping costs.
Once the example is identified as balanced, the clip frames the optimization task as satisfying all demand at minimum total shipping cost.
The compass explanation of northwest leads directly into the rule to start at the top-left cell.
The northwest arrow is followed by circling the top-left table cell.
The geometric meaning of "northwest" is used to justify why the algorithm begins in the upper-left corner of the table.
After identifying the starting cell, the speaker applies the first allocation using supply 35 and demand 45.
The number 35 is written into the starting cell.
The full general allocation rule is not completed in the clip.
The starting-cell rule is immediately applied to compute the first shipment quantity in the example.
The entire video is dedicated to applying this specific method to the given problem type.
The Northwest Corner Method is the specific algorithm being applied to solve the presented transportation problem example.
Immediately after declaring the allocation complete, the narrator says, "So this is our final answer. So to find the total shipping cost, here's what we do."
The board transitions from the completed allocation table to the TOTAL COST expression.
The completed Northwest Corner allocation is the input needed to evaluate the transportation objective by summing allocated quantity times unit cost over occupied cells.
The narrator says there is still 10 demand left, so they need to move down to the next cell and use Factory 3.
A downward arrow appears from the exhausted Factory 2 row to the Factory 3 row within the City 3 column.
These two rules describe opposite transition cases in the Northwest Corner Method: exhausting a row causes a downward move within the same column, whereas satisfying a column causes a rightward move to the next column.
The narrator first crosses out Factory 2 / City 4 due to exhausted supply and then allocates 30 units in Factory 3 / City 4.
The visual sequence shows the unusable cell being eliminated before the final valid allocation is written.
Recognizing that Factory 2 / City 4 is unavailable is necessary before identifying Factory 3 / City 4 as the final active cell.
The speaker connects the calculated cost to the method used: 'So that is our final answer... So that's how we can solve the transportation problem using the northwest corner method.'
The Northwest Corner Method provides the specific allocations (x_{ij}) which are then plugged into the total cost formula to evaluate the solution.
Introduction to the transportation problem with factories and cities.
Full table layout is visible.
Total supply and total demand are both 125.
Handwritten 125 appears for both totals.
Meet demand while minimizing shipping costs.
Compass explanation of northwest as top-left.
Compass drawing and arrow.
Fulfill as much demand as possible based on the factory supply.
35 is written in the top-left cell.
Clip ends before the next step.
The starting cell has cost $8 although cheaper cells exist.
The method is introduced by position, not by minimum cost.
This contrast is not explicitly verbalized in the clip.
Speaker begins by addressing the first cell and its supply/demand.
Speaker explains crossing out the supply once it is fully used.
Speaker calculates the remaining demand after a partial fulfillment.
The narrator says there is still 10 demand left, so they move down to the next cell and use Factory 3.
A downward arrow marks the transition from Factory 2 / City 3 to Factory 3 / City 3.
The narrator says Factory 2 supply is already exhausted, so the Factory 2 / City 4 cell is crossed out.
The Factory 2 / City 4 cell is visibly marked with an X before the final allocation.
The narrator explains that total shipping cost is found by multiplying units in each allocated cell by the unit shipping price and adding the results.
The board writes TOTAL COST: 35($8)+10($9)+20($12)+20($13)+10($16)+30($5).
Covered · Audio introduces the transportation problem and the visual shows the full table structure.
Covered · Supplies and demands are read aloud and highlighted in the table.
Covered · Total supply and total demand are computed and compared, establishing a balanced problem.
Covered · The speaker states the goal of meeting demand while minimizing shipping costs and explains the interior cost entries.
Covered · A compass analogy explains the method name and identifies the top-left starting cell.
Covered · The first allocation is demonstrated by assigning 35 units from Factory 1 to City 1; the clip ends before later steps.
Covered · The entire 120-second clip covers the explanation and visual demonstration of the first two steps of the Northwest Corner Method on a specific transportation problem.
Covered · The narrator announces completion of the current column and movement to City 3; the active cell selection is shown.
Covered · City 3 demand is read as 30, Factory 2 contributes 20, and the residual demand becomes 10.
Covered · The method moves down to Factory 3, allocates 10 to finish City 3, and leaves Factory 3 with 30 supply.
Covered · City 4 is introduced, Factory 2 / City 4 is crossed out, and 30 units are allocated from Factory 3 to City 4.
Covered · The narrator declares the allocation complete and writes the total shipping cost as a sum of quantity-times-unit-cost terms; the final numeric total is not reached in this clip.
Covered · The entire clip shows the final calculation of the total cost for a transportation problem solved via the Northwest Corner Method.
Reviewed English material v1: card/concept_card "Transportation problem table" starting at 0:00 — The video represents a transportation problem as a matrix-like table. Rows are factories (sources), columns are cities (destinations), the rightmost column lists each factory's supply, the bottom row lists each city's demand, and the interior cells list unit shipping costs for each factory-city pair.
YouTube8:20Another explanation of Transportation and assignment problems.
Transportation and assignment problems
YouTube10:40Another explanation of Transportation and assignment problems.
Transportation and assignment problems
YouTube6:47Another explanation of Transportation and assignment problems.
Transportation and assignment problemsYouTube8:20Lecture for Transportation and assignment problems, compared with the current whiteboard.
Transportation and assignment problems