BITSAT
Linear Programming PYQBITSAT 2021
The linear programming problem minimize z = 3x + 2y subject to constrains x + y
Solution
Correct option: B
Answer: B. no feasible solution
Step 1
Draw the boundary line for the first constraint:
Step 2
Draw the boundary line for the second constraint:
Step 3
Now mark the half-planes corresponding to
Step 4
From the graph, there is no common point satisfying all the given constraints simultaneously.
Step 5
Therefore, the LPP has no feasible solution.
