1. There is one, and only one, objective function in a linear program. a. True b. False 2. Which are the non-negative constraints of a linear program? a. X1 , X2 >0 b. X1 , X2 >=0 c. X1 +X2 >0 d. X1 +X2 >=0 3. Every linear program has "non-negative constraints". a. True b. False 4. Equation X1 +2X2 =5 corresponds to a __________ in a two-dimensional coordinate system. a. point b. straight line c. circle d. parabola 5. In a linear program, number of variables must be less than number of constraints. a. True b. False 6. A constraint must be an inequality (either "<=" or ">="). A constraint cannot be an equation ("="). a. True b. False 7. A solution is feasible if it makes a. all the constraints hold. b. at least one constraint hold. 8. RHS stands for "right-hand-side". a. True b. False 9. There is no variable term in RHS. a. True b. False 10. Does (X1 =2, X2 =1) satisfy the constraint 2X1 -3X2 <=2? a. Yes b. No 11. _______ shows the change of the objective function value due to a unit increase of a RHS: a. Optimal range b. Shadow price