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 the optimal objective function value is 0 , then the linear program corresponding to the second priority will have

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