The optimal solution of this linear programming problem is at the intersection of constraints $1(c_1)$ and $2(c_2).$

Max$2x_1+x_2$

s$.$t$.4x_1+1x_{2}400$

$4x_1+3x_{2}600$

$1x_1+2x_{2}300$

$x_1,x_{2}0$

Compute the dual prices for the three constraints $(3$ points$).$

$0\mathrm{.}00,0\mathrm{.}25,$ and $0\mathrm{.}50$

$1\mathrm{.}25,1\mathrm{.}50,$ and $2$

$0\mathrm{.}25,0\mathrm{.}25,$ and $0$

$0\mathrm{.}5,0\mathrm{.}5,$ and $1$