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
________ ________ _______ _________ _____ _____ ___ _________.
_______ _____ __________ ___ ________ ______ _____ _____.
_________ __________ ___ ________ _______.
_______ ________ _________ _________ ______ ________ __________ _________ _________ ____ __________.
___ ___ _______ __________ ________ _________ ______ ______ ________ _______ ____.
_____ __________ __________ ________ ______ ______ ___ ________.
______ __________ ____ _____ ___.
_____ _____ ________ ___ ___ __________ _______ ________ _____ ______ _________.
__________ __________ ________ _____ __________.
_______ ___ _________ __________ ____ _______ ________.
________ _______ ___ _______ ______ ________.
______ _________ ________ ____ ________ ______ ____ _______ ____ _______ _______ ________.
___ ________ _______ ______ ________ ___ _________ _____ ____.
_____ __________ _____ ____ __________ ____ _____ _________ __________.
_______ ___ _____ ______ ______ __________ ____ __________ _____ ______.
_____ ___ __________ ____ _________ ______ ___ ________ ___ _____ __________.
_____ ________ ________ ___ _______ _______ __________ ___ _______ ____ ______ ____.
______ ________ ________ ____ ___ ______ ___ _____.
______ ___ ___ __________ ___ _________ ____.
_________ ________ __________ ___ ____ _____ _______.
_________ ___ __________ _________ ___ _______ ______ ____ _____ _______.
______ ___ ______ ________ _________ ____ _____ _______.
_____ _____ ________ _______ _________ __________ __________ ______ ____ ____ ____.
_________ ____ ______ _________ _______ __________.
___ _______ _______ ___ ________ ____ _________ ________ __________ ________ _______.
_______ _______ ______ _____ __________ __________ _______.
_____ _________ __________ ____ ________ _________ __________ _____ __________ ______ ____.
______ __________ ___ _________ ______ _______ ______ ____ ________ ______ ______.
__________ _______ _________ ____ ______ _________ _______ ______ __________.
__________ _________ ________ ___ ________ ___.
_________ ___ ____ ________.
Skip in 10
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} \) for the flow from \( O_1 \) to \( D_1, D_2, D_3 \) respectively. - \( x_{21}, x_{22}, x_{23} \) for the flow from \( O_2 \) to \( D_1, D_2, D_3 \) respectively. - \( x_{31}, x_{32}, x_{33} \) for the flow from \( O_3 \) to \( D_1, D_2, D_3 \) respectively. ### Step 2: Objective Function The objective is to minimize the transportation cost. The cost of transportation from each source to each destination is
___ _________ ___ ___ _____ _________.________ ________ _______ _________ _____ _____ ___ _________.
_______ _____ __________ ___ ________ ______ _____ _____.
_________ __________ ___ ________ _______.
_______ ________ _________ _________ ______ ________ __________ _________ _________ ____ __________.
___ ___ _______ __________ ________ _________ ______ ______ ________ _______ ____.
_____ __________ __________ ________ ______ ______ ___ ________.
______ __________ ____ _____ ___.
_____ _____ ________ ___ ___ __________ _______ ________ _____ ______ _________.
__________ __________ ________ _____ __________.
_______ ___ _________ __________ ____ _______ ________.
________ _______ ___ _______ ______ ________.
______ _________ ________ ____ ________ ______ ____ _______ ____ _______ _______ ________.
___ ________ _______ ______ ________ ___ _________ _____ ____.
_____ __________ _____ ____ __________ ____ _____ _________ __________.
_______ ___ _____ ______ ______ __________ ____ __________ _____ ______.
_____ ___ __________ ____ _________ ______ ___ ________ ___ _____ __________.
_____ ________ ________ ___ _______ _______ __________ ___ _______ ____ ______ ____.
______ ________ ________ ____ ___ ______ ___ _____.
______ ___ ___ __________ ___ _________ ____.
_________ ________ __________ ___ ____ _____ _______.
_________ ___ __________ _________ ___ _______ ______ ____ _____ _______.
______ ___ ______ ________ _________ ____ _____ _______.
_____ _____ ________ _______ _________ __________ __________ ______ ____ ____ ____.
_________ ____ ______ _________ _______ __________.
___ _______ _______ ___ ________ ____ _________ ________ __________ ________ _______.
_______ _______ ______ _____ __________ __________ _______.
_____ _________ __________ ____ ________ _________ __________ _____ __________ ______ ____.
______ __________ ___ _________ ______ _______ ______ ____ ________ ______ ______.
__________ _______ _________ ____ ______ _________ _______ ______ __________.
__________ _________ ________ ___ ________ ___.
_________ ___ ____ ________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.