Question
Solve the following LPP graphically:
aximize:
$
subject to the constraints:$
$
$
b) Find all values of k for which the vectors:$
are linearly independent.
Answer :
Word Count : 509
__________ ____ ______ _______ ______ ______ ____ ___ __________ _____ __________.
____ ___ _________ _______ __________ ________ _____.
________ ________ _________ _______ ___ ____ ________ _______ ____ ________.
___ _________ ______ _________ _______ ______ ______ ____.
__________ ____ _________ ______ _______ _____ __________ ____ _____ __________.
___ _____ ___ ________ _______ ____.
__________ _________ __________ ___ _______ _____ _______.
______ _______ ____ _________ _______ _________ _____ _____ ____ _________ _______.
__________ _______ ________ _____ ___ _________ ____ __________ ________ _____ ______ ___.
_________ ____ ________ ____ _______ ___ _______.
__________ ________ _________ ________ __________.
______ _______ ____ ________ ______.
______ _____ _________ __________ _______ _________ _____ __________.
_____ __________ _______ __________ ______ _____ ____ ______ ___.
____ ___ _______ _____ _______ _________ ______ _______ _____ _________.
________ _____ _____ ___ ___ _____ ____ _______ ________ ________ ____.
_________ _____ _________ ___ ____ ___ ___ ______ ______ _________ _____ ____.
________ ____ __________ ________ ________.
_________ ____ _______ ________ ____ ____ ____ ______ _________ ________ ____.
________ _______ ___ _____ __________ _________ ________ ___ ____ ______ ____ ________.
___ ________ ________ _______ ________ _________ _____ ______ ____ __________.
___ ______ ______ _________ ______ __________ ________ _____ ____.
______ __________ _______ __________ _____ _______ ___ ______ _____ __________.
_____ _____ __________ ___ _________ ________ ________ _______ ___ ________.
___ ________ _____ __________ __________ _______ __________ ____ ______ _____ ________ ______.
______ _____ __________ _______ ________.
__________ ____ __________ ______ __________ _______ ________ ___ _________ _________ ______ __________.
___ ___ _________ ________ _______.
___ _________ ______ ______ _____ ___ __________ ____ ___.
______ ______ __________ ______ ______ __________ ______ _____.
_______ _____ ________ ________ ______ __________ ______ __________ ______ ____ __________ ____.
___ _______ _____ _____ ___ _____ ________ _______ ______ __________.
____ _______ _______ ________ _____ __________ _____.
_______ ______ _______ __________ _____ ________.
__________ ________ ______ ___ _______ ______.
________ ___ _______ _______ ______ ___ ____.
_______ ___ ___ ________ ________ ________ ______.
_________ _____ ___ ______ ___ ________ __________ _________ _______.
____ _____ _____ ___ ______.
______ _________ ____ ________ _______.
_____ ___ ________ __________ _____ _____ ________ _____ ________.
_________ _______ ___ _______ _________ _____ __________ ___ ___ ______.
________ ____ ________ _______ ________ ___ ____ _________ ______ ______ _________.
______ ________ _______ _________ _______.
__________ ____ ____ _________ ______ _____ _____.
________ _____ _____ ______ _______ ______ _______.
________ _______ __________ ____ ________ ________ ___ _________ __________.
Skip in 10
The given Linear Programming Problem (LPP) is: Maximize ( z = 10x_1 + 10x_2 ) subject to: [ 4x_1 + 3x_2 \le 12, \quad 6x_1 + 18x_2 \le 36, \quad x_1, x_2 \ge 0 ] First, we convert the inequalities to equalities to find the boundary lines: 1. ( 4x_1 + 3x_2 = 12 ) * (x_1)-intercept: (x_2 = 0 \Rightarrow 4x_1 = 12 \Rightarrow x_1 = 3) * (x_2)-intercept: (x_1 = 0 \Rightarrow 3x_2 = 12 \Rightarrow x_2 = 4) 2. ( 6x_1 + 18x_2 = 36 ) * (x_1)-intercept: (x_2 = 0 \Rightarrow 6x_1 = 36 \Rightarrow x_1 = 6)
_____ _______ _______ _____ _________ ____ _______ ____.__________ ____ ______ _______ ______ ______ ____ ___ __________ _____ __________.
____ ___ _________ _______ __________ ________ _____.
________ ________ _________ _______ ___ ____ ________ _______ ____ ________.
___ _________ ______ _________ _______ ______ ______ ____.
__________ ____ _________ ______ _______ _____ __________ ____ _____ __________.
___ _____ ___ ________ _______ ____.
__________ _________ __________ ___ _______ _____ _______.
______ _______ ____ _________ _______ _________ _____ _____ ____ _________ _______.
__________ _______ ________ _____ ___ _________ ____ __________ ________ _____ ______ ___.
_________ ____ ________ ____ _______ ___ _______.
__________ ________ _________ ________ __________.
______ _______ ____ ________ ______.
______ _____ _________ __________ _______ _________ _____ __________.
_____ __________ _______ __________ ______ _____ ____ ______ ___.
____ ___ _______ _____ _______ _________ ______ _______ _____ _________.
________ _____ _____ ___ ___ _____ ____ _______ ________ ________ ____.
_________ _____ _________ ___ ____ ___ ___ ______ ______ _________ _____ ____.
________ ____ __________ ________ ________.
_________ ____ _______ ________ ____ ____ ____ ______ _________ ________ ____.
________ _______ ___ _____ __________ _________ ________ ___ ____ ______ ____ ________.
___ ________ ________ _______ ________ _________ _____ ______ ____ __________.
___ ______ ______ _________ ______ __________ ________ _____ ____.
______ __________ _______ __________ _____ _______ ___ ______ _____ __________.
_____ _____ __________ ___ _________ ________ ________ _______ ___ ________.
___ ________ _____ __________ __________ _______ __________ ____ ______ _____ ________ ______.
______ _____ __________ _______ ________.
__________ ____ __________ ______ __________ _______ ________ ___ _________ _________ ______ __________.
___ ___ _________ ________ _______.
___ _________ ______ ______ _____ ___ __________ ____ ___.
______ ______ __________ ______ ______ __________ ______ _____.
_______ _____ ________ ________ ______ __________ ______ __________ ______ ____ __________ ____.
___ _______ _____ _____ ___ _____ ________ _______ ______ __________.
____ _______ _______ ________ _____ __________ _____.
_______ ______ _______ __________ _____ ________.
__________ ________ ______ ___ _______ ______.
________ ___ _______ _______ ______ ___ ____.
_______ ___ ___ ________ ________ ________ ______.
_________ _____ ___ ______ ___ ________ __________ _________ _______.
____ _____ _____ ___ ______.
______ _________ ____ ________ _______.
_____ ___ ________ __________ _____ _____ ________ _____ ________.
_________ _______ ___ _______ _________ _____ __________ ___ ___ ______.
________ ____ ________ _______ ________ ___ ____ _________ ______ ______ _________.
______ ________ _______ _________ _______.
__________ ____ ____ _________ ______ _____ _____.
________ _____ _____ ______ _______ ______ _______.
________ _______ __________ ____ ________ ________ ___ _________ __________.
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.