A Linear programming problem has the following three constraints: $4$X $+27$Y $<=108$; $3$X $+13$Y$=39$; and $9$X $-$ Y $<=43\mathrm{.}1538.$ The objective function is Min $11$X $+28$Y $.$ What combination of X and Y will yield the optimum solution for this problem?

Question $15$

Answer

a$.$

$5,1\mathrm{.}84615$

b$.$

$0,3$

c$.$

infeasible problem

d$.$

unbounded problem

e$.$

$13,0$