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.