1) Linear programming finds the optimal mix where choice and constraints exist. Which of the following is incorrect about linear programming? a. The shadow price explains how much the objective function will improve if one more unit of finished product is completed. b. A shadow price of zero is possible c. Only constraints that are binding will have a shadow price > 0. d. Solver calls the shadow price the "Lagrange Multiplier"

2) A linear programming problem can have: a. A maximum of six constraints b. Resource, structural and non-negativity constraints c. A maximum of two binding constraints d. An objective function result that must be positive

3) The Theory of Constraints: a. Concentrates efforts anywhere but the bottleneck. b. Tries to keep the bottleneck function working at full capacity c. Aims to keep inventory levels at zero d. A & B e. B & C

4) The theory of constraints uses a different definition of Inventory Cost than traditional cost accounting. Which of these statements are correct? a. Only DM and DL are counted as inventory cost b. This means the approach that the Theory of constraints takes is wrong c. Only the cost of the inventory is considered inventory cost d. MOH is allocated only for the bottleneck function

5) An employee bonus program that includes elements of customer satisfaction and employee growth is using concepts related to: a. Nash's game theory b. Kaplan's Balanced scorecard c. Porter's Five Forces d. Elliott's variance analysis framework