Linear Programming Question 35
Question: The L.P. problem Max $ z=x_1+x_2 $ such that $ -2x_1+x_2\le 1,\ x_1\le 2,\ x_1+x_2\le 3 $ and $ x_1,\ x_2\ge 0 $ has
Options:
A) One solution
B) Three solution
C) An infinite no. of solution
D) None of these
Show Answer
Answer:
Correct Answer: C
Solution:
Objective function is same as constraint so there are infinite solutions possible.
BETA
