Question
Write the LPP formulation of the following transportation problem:
| Destination | Supply | |||||||||
| D1 | D2 | D3 | ||||||||
| O1 | 10 | 18 | 12 | 200 | ||||||
| Source | O2 | 15 | 17 | 9 | 300 | |||||
| O3 | 13 | 15 | 7 | 500 | ||||||
| Requirement | 400 | 200 | 400 | |||||||
Answer :
Word Count : 436
To formulate the given transportation problem as a Linear Programming Problem (LPP), we need to define the decision variables, objective function, and constraints. ### Step 1: Decision Variables Let \( x_{ij} \) represent the amount transported from source \( O_i \) to destination \( D_j \), where: - \( i = 1, 2, 3 \) (sources \( O_1, O_2, O_3 \)) - \( j = 1, 2, 3 \) (destinations \( D_1, D_2, D_3 \)) Thus, we have the following decision variables: - \( x_{11}, x_{12}, x_{13} _____ __________ __________ _________ _____ ______.
_______ ____ ______ ________ __________ _______ ______ ____ ___ ___ __________ _____.
__________ ________ ___ __________ _________.
________ __________ ___ ___ ________ ______ __________ ________.
_________ _________ ___ ____ _________ ___ ___ _____ ___ _________ ____.
________ __________ ____ __________ ___.
_______ ______ _______ ______ _______ __________ ____ ________.
_____ ______ __________ ___ _____ ____ ______ ______ ____ ______ __________.
__________ _______ __________ ___ _____ ______ ____ ______ __________ ___ _________.
___ ___ _________ __________ __________ ____ ______ ______ _________ ____ ________ __________.
_____ _______ _______ ______ _______ ______ _____ _______ __________ _______ _____ _____.
___ ____ _________ _________ ____ __________.
___ ______ ______ ____ _____ ___ _________ _________ _____ _____ _______.
____ _____ ___ ________ _________ __________ ________ ________ _______ ____ _______.
____ _________ ___ ___ ____.
_________ _____ ______ __________ ___.
________ ________ _____ ______ ____ _________ ____ ________.
______ __________ ______ ______ ________ ________ ________ _______.
_________ __________ _____ _____ __________ ________ _____ _____ _____ ___ __________ ____.
_________ ___ ___ __________ ___ ____ ______ ______ _______ _____ ___ _________.
____ ________ __________ ____ ___ _____ __________ ________ ________ _________ _________ ________.
_________ _____ __________ __________ ______.
________ _____ _________ ___ _________ _____ _________.
___ _____ ___ ________ ______ ______ _________ ________.
__________ _________ ____ _______ ________ _______ ___.
___ __________ ______ _______ ____ _________ ______ ___ _____ _________.
______ ___ ________ _______ _____ ___ _____ ________ __________ ______ ________.
____ _______ __________ ______ _________ __________ ______ _________ ___ ___ _______.
_________ ________ _______ _______ _____.
____ _______ ___ ____ _________ ___ ______ ______.
____ ______ ________ ____ ________.
_________ _____ ______ _________ __________ _______ __________ _______ _____ _________ __________.
________ ___ _____ _____ _________ _______.
____ _________ ________ __________ ___ ___ ________.
________ ___ __________ __________ ______ ____.
______ ___ ____ ____ ______ _____ ____ ________ ____ ______ _________ __________.
_____ _________ _____ ___ __________ ___ _____ _____ ____ ________ ________.
_________ ______ _________ ________ _________ ___ _____ ______ _________.
____ _________ _________ _________ ___ ______ ____ ________ ___ ___ ____.
___ ____ _______ _________ ___ _____.
___ _____.
Get Full Answer on WhatsApp
To formulate the given transportation problem as a Linear Programming Problem (LPP), we need to define the decision variables, objective function, and constraints. ### Step 1: Decision Variables Let \( x_{ij} \) represent the amount transported from source \( O_i \) to destination \( D_j \), where: - \( i = 1, 2, 3 \) (sources \( O_1, O_2, O_3 \)) - \( j = 1, 2, 3 \) (destinations \( D_1, D_2, D_3 \)) Thus, we have the following decision variables: - \( x_{11}, x_{12}, x_{13} _____ __________ __________ _________ _____ ______.
_______ ____ ______ ________ __________ _______ ______ ____ ___ ___ __________ _____.
__________ ________ ___ __________ _________.
________ __________ ___ ___ ________ ______ __________ ________.
_________ _________ ___ ____ _________ ___ ___ _____ ___ _________ ____.
________ __________ ____ __________ ___.
_______ ______ _______ ______ _______ __________ ____ ________.
_____ ______ __________ ___ _____ ____ ______ ______ ____ ______ __________.
__________ _______ __________ ___ _____ ______ ____ ______ __________ ___ _________.
___ ___ _________ __________ __________ ____ ______ ______ _________ ____ ________ __________.
_____ _______ _______ ______ _______ ______ _____ _______ __________ _______ _____ _____.
___ ____ _________ _________ ____ __________.
___ ______ ______ ____ _____ ___ _________ _________ _____ _____ _______.
____ _____ ___ ________ _________ __________ ________ ________ _______ ____ _______.
____ _________ ___ ___ ____.
_________ _____ ______ __________ ___.
________ ________ _____ ______ ____ _________ ____ ________.
______ __________ ______ ______ ________ ________ ________ _______.
_________ __________ _____ _____ __________ ________ _____ _____ _____ ___ __________ ____.
_________ ___ ___ __________ ___ ____ ______ ______ _______ _____ ___ _________.
____ ________ __________ ____ ___ _____ __________ ________ ________ _________ _________ ________.
_________ _____ __________ __________ ______.
________ _____ _________ ___ _________ _____ _________.
___ _____ ___ ________ ______ ______ _________ ________.
__________ _________ ____ _______ ________ _______ ___.
___ __________ ______ _______ ____ _________ ______ ___ _____ _________.
______ ___ ________ _______ _____ ___ _____ ________ __________ ______ ________.
____ _______ __________ ______ _________ __________ ______ _________ ___ ___ _______.
_________ ________ _______ _______ _____.
____ _______ ___ ____ _________ ___ ______ ______.
____ ______ ________ ____ ________.
_________ _____ ______ _________ __________ _______ __________ _______ _____ _________ __________.
________ ___ _____ _____ _________ _______.
____ _________ ________ __________ ___ ___ ________.
________ ___ __________ __________ ______ ____.
______ ___ ____ ____ ______ _____ ____ ________ ____ ______ _________ __________.
_____ _________ _____ ___ __________ ___ _____ _____ ____ ________ ________.
_________ ______ _________ ________ _________ ___ _____ ______ _________.
____ _________ _________ _________ ___ ______ ____ ________ ___ ___ ____.
___ ____ _______ _________ ___ _____.
___ _____.
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★★★