In Goal Programming Models, Suppose We Have Solved the Linear $10 \mathrm{u}_{1}$

Multiple Choice

In goal programming models, suppose we have solved the linear program corresponding to the first priority by minimizing $10 \mathrm{u}_{1}$ . If $\mathrm{u}_{1}=5$ in the optimal solution, then the linear program corresponding to the second priority will have

A) no new constraints
B) one additional constraint $\mathrm{u}_{1}=5$
C) one additional constraint $u_{1} \geq 5$
D) one additional constraint $u_{1} \leq 5$