Linear Programming Question 126
Consider: $ z=3x+2y $ Minimize subject to: $ x+y\ge 8 $ $ 3x+5y\le 15 $ $ x,y\ge 0 $ It has:
Options:
A) Infinite feasible solutions
B) Unique feasible solution
C) No feasible solution
D) None of these
Show Answer
Answer:
Correct Answer: C
Solution:
Given problem is minimize $ z=3x+2y $ subject to $ x+y\ge 8, $
$ 3x+5y\le 15 $
$ x,y\ge 0 $
First we convert these into equations and draw the graph. Since there is no feasible region, there is no feasible solution.
BETA
