Consider the following linear program.

minimize $1+2$

subject to $1+2>=1$

$1>=0$

$2$

is unconstrained

Part A

Find conditions on $$

and $$

to make this infeasible.

Part B

Find conditions on $$

and $$

to make this feasible.

Part C

Find conditions on $$

and $$

to make this have a unique optimal solution.

Part D

Find conditions on $$

and $$

to make this have multiple optimal solution.

Part E

Find conditions on $$

and $$

to make this unbounded.