Question
Using matrix – minima method, find the initial basic feasible solution of the following transportation problem:
| 4 | 6 | 8 | 8 | 40 |
| 6 | 8 | 6 | 7 | 60 |
| 5 | 7 | 6 | 8 | 50 |
| 20 | 30 | 50 | 50 |
Hence find the optimal solution.
Answer :
Word Count : 753
The given transportation problem consists of a cost matrix, supply, and demand constraints. The Matrix Minima Method is a heuristic approach to find the Initial Basic Feasible Solution (IBFS) by allocating to the lowest cost cells first. Let's solve it step by step. ### Step 1: Construct the Cost Matrix with Supply and Demand The given transportation table: | Supply \ Demand | 20 | 30 | 50 | 50 | Supply | |--------------|----|----|----|----|--------| | Source 1 | 4 | 6 | 8 | 8 | 40 | | Source 2 | 6 | 8 | 6 | 7 | 60 | | Source 3 | 5 | 7 | 6 | 8 | 50 | | Demand | 20 | 30 | 50 | 50 | | ### Step 2: Matrix Minima Method The Matrix Minima Method involves: 1. Identifying the minimum cost cell. 2. Allocating the minimum of supply or demand to that cell. 3. Updating the remaining supply and demand. 4. Repeating the process until all supply and demand are satisfied. #### Allocations: 1. Minimum cost = 4 (Cell 1,1) - Allocate 20 (min of _________ ___ ___ ________ __________ _____ _________.
_______ ___ __________ __________ _____ _________.
_______ __________ __________ ________ _______ ___ _____ _________ _____.
_________ _____ _______ __________ __________ _________ __________ ______ ______.
_______ _______ _____ _____ _____ ________ ____ _________ ______ _______.
________ ________ ___ _______ _______ _______ _______ __________ _______.
_______ ______ _____ ________ ____ _______ ______.
___ _______ _________ ________ ___ _____ ______ _______ __________ _______.
____ __________ _____ ________ ____ ______ ____ ________ __________ __________ _____.
_______ ____ ____ _______ _________ _________ ____ _________ _________ ________.
_____ ________ ____ ___ __________ ___ _______ _______ _______.
______ ______ __________ __________ ______ ________ ____ ____ ______ __________.
______ _________ ________ _____ ________ ________ ___ _______ ________ ____.
___ ___ _____ _____ _________ ________ _______ ________ ______ _____.
_______ ___ ___ __________ ________ ____ ___.
___ __________ _________ _____ _________ _____ ________ ____ ___ ________ ____.
___ ________ ____ ______ _____ _________ ________.
_____ ____ ______ _____ ______ ________ __________ ___ ______.
_______ ___ ____ _______ _________ _______ ____.
____ _________ _______ __________ ________ ____ _____ ________.
_____ ______ _______ ___ _______.
________ ____ ___ ______ ______ __________ _________ _________ ______ __________.
_________ _________ _______ __________ ____ ___ _________ ________ __________.
__________ _________ __________ _________ _____ ____ ________ __________ _____ _______ _____.
___ ________ _____ __________ ________ _________ _______ _________ __________ ____ _____.
_____ ______ ______ ________ ________ _____ _______.
_______ ___ ______ ______ ____ ___ ______ _________.
_______ ______ ___ ___ __________.
___ _________ _____ ________ ______ _________ _____ ________.
_____ __________ ______ ___ _________ __________ _____ ____ __________ ___.
______ ________ _______ ________ _______ ______ _________ _____ _____.
_____ _________ ______ _____ _______.
____ ____ ________ ________ _________.
____ ______ _____ _______ _________ ___ _______ __________ ________ _______ ___.
_______ __________ ______ _________ ____ ______ _________ ________.
_______ _______ __________ _________ _________ _____ _______ ______ _________ ______ _________.
________ _____ ____ ____ _________ ____.
_________ _______ ___ ________ _____ _______ _____ ___ ___.
____ ___ _______ ____ _______ _________ _______ ___.
___ ____ ____ ___ _____.
______ __________ _________ __________ ___ ___.
____ ____ __________ ____ ____ _________ ___ ________ __________ _______ _______.
___ _________ _____ ___ __________ _____ _____ _______ ________ __________.
________ ________ ______ _________ _____ __________ _________ ____ ________ _____.
____ ___ ____ ___ ________ _________ ___ __________.
____ ____ _____ __________ ________.
___ _________ ________ _____ ________ ___ ____ ______.
__________ ______ _______ _________ _________.
_________ ____ ____ _____ ______ ________.
____ _________ _____ __________ ______ ___ _______ ______ ________.
_________ ________ ___ _________ _____ _______ __________ ____.
___ _________ __________ ___ ____ ___ ____ _____.
_______ ______ __________ ____ ___.
________ __________ __________ ___ _________ ______ ________ _______ ___ ____.
__________ ______ _____ __________ ____ __________.
_______ __________ ________ __________ _________ __________ ____ ______ _______.
__________ _________ ________ ______ ___ _____ ________ ________.
_____ ____ ________ ________ ____ ______.
_________ _______ ____ _____ ___ __________ __________.
______ _____ ________ ______ ______ ____.
________ ________ ______ _______ __________ _______ _________.
_______ ______ __________ ______ _______ _________ ___ ______ ____ __________ ___ _______.
_______ _______ ____ __________ __________ ___ __________ ______ _____ _________ _________.
_______ _________ ________ _______ ______.
_____ ________ _______ _____ ________ _________ __________ _____ ___ ___ ______ _______.
______ ________ ____ ____ _____ ___ _____ ______ _____ ______.
_______ ____ ____ __________ ________ _______ __________ ____ __________ __________ _________.
________ __________ ___ ______ ___ ________ ______ ______ ______.
Get Full Answer on WhatsApp
The given transportation problem consists of a cost matrix, supply, and demand constraints. The Matrix Minima Method is a heuristic approach to find the Initial Basic Feasible Solution (IBFS) by allocating to the lowest cost cells first. Let's solve it step by step. ### Step 1: Construct the Cost Matrix with Supply and Demand The given transportation table: | Supply \ Demand | 20 | 30 | 50 | 50 | Supply | |--------------|----|----|----|----|--------| | Source 1 | 4 | 6 | 8 | 8 | 40 | | Source 2 | 6 | 8 | 6 | 7 | 60 | | Source 3 | 5 | 7 | 6 | 8 | 50 | | Demand | 20 | 30 | 50 | 50 | | ### Step 2: Matrix Minima Method The Matrix Minima Method involves: 1. Identifying the minimum cost cell. 2. Allocating the minimum of supply or demand to that cell. 3. Updating the remaining supply and demand. 4. Repeating the process until all supply and demand are satisfied. #### Allocations: 1. Minimum cost = 4 (Cell 1,1) - Allocate 20 (min of _________ ___ ___ ________ __________ _____ _________.
_______ ___ __________ __________ _____ _________.
_______ __________ __________ ________ _______ ___ _____ _________ _____.
_________ _____ _______ __________ __________ _________ __________ ______ ______.
_______ _______ _____ _____ _____ ________ ____ _________ ______ _______.
________ ________ ___ _______ _______ _______ _______ __________ _______.
_______ ______ _____ ________ ____ _______ ______.
___ _______ _________ ________ ___ _____ ______ _______ __________ _______.
____ __________ _____ ________ ____ ______ ____ ________ __________ __________ _____.
_______ ____ ____ _______ _________ _________ ____ _________ _________ ________.
_____ ________ ____ ___ __________ ___ _______ _______ _______.
______ ______ __________ __________ ______ ________ ____ ____ ______ __________.
______ _________ ________ _____ ________ ________ ___ _______ ________ ____.
___ ___ _____ _____ _________ ________ _______ ________ ______ _____.
_______ ___ ___ __________ ________ ____ ___.
___ __________ _________ _____ _________ _____ ________ ____ ___ ________ ____.
___ ________ ____ ______ _____ _________ ________.
_____ ____ ______ _____ ______ ________ __________ ___ ______.
_______ ___ ____ _______ _________ _______ ____.
____ _________ _______ __________ ________ ____ _____ ________.
_____ ______ _______ ___ _______.
________ ____ ___ ______ ______ __________ _________ _________ ______ __________.
_________ _________ _______ __________ ____ ___ _________ ________ __________.
__________ _________ __________ _________ _____ ____ ________ __________ _____ _______ _____.
___ ________ _____ __________ ________ _________ _______ _________ __________ ____ _____.
_____ ______ ______ ________ ________ _____ _______.
_______ ___ ______ ______ ____ ___ ______ _________.
_______ ______ ___ ___ __________.
___ _________ _____ ________ ______ _________ _____ ________.
_____ __________ ______ ___ _________ __________ _____ ____ __________ ___.
______ ________ _______ ________ _______ ______ _________ _____ _____.
_____ _________ ______ _____ _______.
____ ____ ________ ________ _________.
____ ______ _____ _______ _________ ___ _______ __________ ________ _______ ___.
_______ __________ ______ _________ ____ ______ _________ ________.
_______ _______ __________ _________ _________ _____ _______ ______ _________ ______ _________.
________ _____ ____ ____ _________ ____.
_________ _______ ___ ________ _____ _______ _____ ___ ___.
____ ___ _______ ____ _______ _________ _______ ___.
___ ____ ____ ___ _____.
______ __________ _________ __________ ___ ___.
____ ____ __________ ____ ____ _________ ___ ________ __________ _______ _______.
___ _________ _____ ___ __________ _____ _____ _______ ________ __________.
________ ________ ______ _________ _____ __________ _________ ____ ________ _____.
____ ___ ____ ___ ________ _________ ___ __________.
____ ____ _____ __________ ________.
___ _________ ________ _____ ________ ___ ____ ______.
__________ ______ _______ _________ _________.
_________ ____ ____ _____ ______ ________.
____ _________ _____ __________ ______ ___ _______ ______ ________.
_________ ________ ___ _________ _____ _______ __________ ____.
___ _________ __________ ___ ____ ___ ____ _____.
_______ ______ __________ ____ ___.
________ __________ __________ ___ _________ ______ ________ _______ ___ ____.
__________ ______ _____ __________ ____ __________.
_______ __________ ________ __________ _________ __________ ____ ______ _______.
__________ _________ ________ ______ ___ _____ ________ ________.
_____ ____ ________ ________ ____ ______.
_________ _______ ____ _____ ___ __________ __________.
______ _____ ________ ______ ______ ____.
________ ________ ______ _______ __________ _______ _________.
_______ ______ __________ ______ _______ _________ ___ ______ ____ __________ ___ _______.
_______ _______ ____ __________ __________ ___ __________ ______ _____ _________ _________.
_______ _________ ________ _______ ______.
_____ ________ _______ _____ ________ _________ __________ _____ ___ ___ ______ _______.
______ ________ ____ ____ _____ ___ _____ ______ _____ ______.
_______ ____ ____ __________ ________ _______ __________ ____ __________ __________ _________.
________ __________ ___ ______ ___ ________ ______ ______ ______.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★