1. T/F When we solve a linear programming problem with Solver (using the Simplex LP algorithm), we cannot guarantee that the solution obtained is an optimal solution.

2. In a minimum cost network flow model, the flow balance constraint for each supply node takes which form?

a. Net Inflow = Demand

b. Net Inflow Demand

c. Net Outflow > Capacity

d. Net Outflow Capacity

3. T/F - Reduced costs indicate how much the objective coefficient of a decision variable that is currently 0 or at its upper bound must change before the final value of that variable changes.

4. The flow balance constraint for each transshipment node, in a minimum cost network flow model, takes which form?

a. Net Outflow = Capacity

b. Net Outflow < Capacity

c. Net Inflow=0 (equivalent to Net Outflow=0)

d. Net Inflow Demand

5. Which of the following represents a constraint in the aggregate planning problem? a. Minimization of total costs

b. workers hired/fired need to be integer numbers

c. The quality level produced must be equal to or exceed specification

d. How many units to produce each month