Week 5 Quiz 3

Week 5 Quiz 3:

1. The terms in the objective function or constraints are not additive. TRUE/ FALSE

2. A feasible solution violates at least one of the constraints. TRUE/ FALSE

3. Which of the following could not be a linear programming problem constraint?
a. 1A + 2B b. 1A + 2B = 3 c. 1A + 2B > 3 d. 1A + 2B < 3

4. In a linear programming problem, a valid objective function can be represented as A) Max Z = 5xy B) Max Z 5x2 + 2y2 C) Max 3x + 3y + 1/3z D) Min (x1 + x2) / x3

5. Non-negativity constraints restrict the decision variables to negative values. TRUE/ FALSE

6. A graphical solution is limited to linear programming problems with ___ decision variables
2

7. A constraint is a linear relationship representing a restriction on decision making. TRUE/ FALSE

8. Linear programming is a model consisting of linear relationships representing a firm's decisions given an objective and resource constraints. TRUE/ FALSE

9. Non-negativity constraints A) restrict the decision variables to zero. B) restrict the decision variables to positive values C) restrict the decision variables to negative values D) do not restrict the sign of the decision variable. E) both A and B

10. Decision models are mathematical symbols representing levels of activity. TRUE/ FALSE

11. Which of the following could be a linear programming objective function? A) Z = 1A + 2BC + 3D B) Z = 1A + 2B + 3C + 4D C) Z = 1A + 2B / C + 3D D) Z = 1A + 2B2 + 3D E) all of the above

12. Decision variables A) measure the objective function B) measure how much or how many items to produce, purchase, hire, etc. C) always exist for each constraint D) measure the values of each constraint

13. A linear programming model consists of decision variables, constraints, but no objective function. TRUE/ FALSE