Question
Solve the following LP problem through SIMPLEX method
Minimize Z = 2x1 + 5x2
Subject to x1 + x2 = 100
x1 ≤ 40
x2 ≥ 30
x1, x2 ≥ 0
Answer :
Word Count : 299
__________ ________ ________ ___ __________ _________ _____ ______ ____ ________.
____ ________ _______ _______ _____ _____ ___ ___ _______.
______ _____ ________ _______ ________ ___ ________ ______ _____ _______.
_________ _______ _______ ________ ______ ______ _______ _________ __________ _____.
___ _________ ___ ________ ______.
_________ ______ ____ _________ _____ __________ _______.
_____ __________ ____ ________ _____ __________ _____ _______ __________ ________ ________ ________.
______ __________ ______ ______ __________ ___ __________ _____ ________ _____ ______ ______.
_________ ____ _____ _______ _____ ____ ______ ___ _________.
______ ___ _____ ___ _______ _______ _______ ___ _______ ___.
____ ___ ________ _______ _____ _________ ______ ______ _______.
__________ _______ ______ _______ ________ ____ ______ __________ _____ ________ __________ _____.
___ _________ ___ ___ ____ _____.
____ _______ ___ ________ ___ __________.
______ ______ __________ ___ _________ _________ _____ ____ _______ __________ _______ _____.
_________ ________ ________ ____ ______ __________.
_____ ___ __________ ___ ____ _____ ________ ________ ______ _________.
_____ _______ ______ ______ ______ _______ _________ _________ _____ _________.
________ _____ ______ ________ ______ ___ ____ _________.
____ _________ _______ _________ __________ __________ _______ _________ _________ _________.
_________ ________ _______ ______ _________ ____ ___ ________.
______ ____ ______ ___ ________ _________.
________ ____ _______.
Skip in 10
Since the given objective function is of minimisation type we shall convert it in to a maximisation type as follows:
Maximise (-Z) = Maximise Z* = - 2x1 - 5 x2
Subject to the constraints
x1 + x2 = 100
x1 ≤ 40
x2 ≥ 30
x1, x2 ≥ 0
By introducing the non-negative slack variable s1, surplus variable s2 and the artificial variables R1 and R2, the standard form of LPP becomes
Maximise Z* = - 2x1 - 5 x2 + 0s1+ 0s2 –MR1 -MR2
Subject to the constraints
x1 + x2 + R1 = 100
x1 +
____ ________ _______ _______ _____ _____ ___ ___ _______.
______ _____ ________ _______ ________ ___ ________ ______ _____ _______.
_________ _______ _______ ________ ______ ______ _______ _________ __________ _____.
___ _________ ___ ________ ______.
_________ ______ ____ _________ _____ __________ _______.
_____ __________ ____ ________ _____ __________ _____ _______ __________ ________ ________ ________.
______ __________ ______ ______ __________ ___ __________ _____ ________ _____ ______ ______.
_________ ____ _____ _______ _____ ____ ______ ___ _________.
______ ___ _____ ___ _______ _______ _______ ___ _______ ___.
____ ___ ________ _______ _____ _________ ______ ______ _______.
__________ _______ ______ _______ ________ ____ ______ __________ _____ ________ __________ _____.
___ _________ ___ ___ ____ _____.
____ _______ ___ ________ ___ __________.
______ ______ __________ ___ _________ _________ _____ ____ _______ __________ _______ _____.
_________ ________ ________ ____ ______ __________.
_____ ___ __________ ___ ____ _____ ________ ________ ______ _________.
_____ _______ ______ ______ ______ _______ _________ _________ _____ _________.
________ _____ ______ ________ ______ ___ ____ _________.
____ _________ _______ _________ __________ __________ _______ _________ _________ _________.
_________ ________ _______ ______ _________ ____ ___ ________.
______ ____ ______ ___ ________ _________.
________ ____ _______.
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.