Q3,paper3,d13. The following Linear Programming problem has : Max Z = x1+x2 Subject to x1– x2≥0 3x1– x2≤–3 and x1, x2≥0

(A) Feasible solution

(B) No feasible solution

(C) Unbounded solution

(D) Single point as solution.

Answer B.

Explanation.

X1-x2>=0.

X1>=x2.

X2>= 3x1+3.

Feasible solution is a set of points which solves all the constraints. Hence it has no feasible solution.