# UGCNET-Dec2013-III: 3

1.2k views

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$

1. Feasible solution
2. No feasible solution
3. Unbounded solution
4. Single point as solution

recategorized

ans is B no feasible solution

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

selected

## Related questions

1
466 views
Given the problem to maximize $f(x), X=(x_1, x_2, \dots , x_n)$ subject to m number of in equality constraints. $g_i(x) \leq b_i$, i=1, 2, .... m including the non-negativity constrains $x \geq 0$ ... $g_i (\bar{X}) \leq b_i, i=1,2 \dots m$ All of these