A Linear programming problem has the following three constraints: 40X + 21Y <= 840; 18X + 13Y= 234; and 9X - Y <= 96.2308 . The objective function is Min 20X + 47Y . What combination of X and Y will yield the optimum solution for this problem?

a.

13 , 0

b.

11 , 2.76923

c.

infeasible problem

d.

unbounded problem

e.

0 , 18