IV. Answer the following questions. A typical network problem with 3 supply nodes, 2 transshipment nodes and 4 demand nodes will have Decision variables and constraints 1. 2. In the CPM /PERT context, the critical path is the longest path in the network True False When the right-hand sides of two constraints are increased by one unit each, the OF value will be adjusted by the sum of the constraints' shadow prices. 3. True False 4. A constraint with a positive slack value a. will have a positive shadow price. b. will have a negative shadow price. c. will have a shadow price of zero. d. has no restrictions for its shadow price. If we delete a redundant constraint, the feasible region will not change. 5. True False 6. An unbounded feasible region will yield an unbounded solution. True False 7. If I make some changes to the objective function. (a) there will not be any changes in the optimal solution (b) the basis will not change the feasible region will not change the problem could become infeasible