UGC NET CSE | December 2013 | Part 3 | Question: 3

Question

The following Linear Programming problem has:

$\text{Max} \quad Z=x_1+x_2$

Subject to $\quad x_1-x_2 \geq 0$

$\quad \quad \quad 3x_1 - x_2 \leq -3$

$\text{and} \quad x_1 , x_2 \geq 0 $

• A. Feasible solution
• B. No feasible solution
• C. Unbounded solution
• D. Single point as solution

Answer 1

ans is B no feasible solution 

draw lines for two inequalities nothing is common in shaded area so infeasible solution