Suppose that many feasible solutions have been found for an

Suppose that many feasible solutions have been found for an IP with two objective functions. Six of these solutions are non-dominated and the rest are dominated. If a third objective were added to the LP, one or more of the dominated solutions could potentially become non-dominated. T F The branch and bound algorithm presented in class operates by successively re-optimizing the objective function on successively smaller feasible regions. T F In order to solve an optimization problem using dynamic programming, the problem must conform to the same four assumptions made for linear programs. T F

Solution

1)F

2)T

3)T