Question: 1. It is impossible for a linear program with unbounded feasible region to have a unique optimal solution. True or False? 2. It is impossible
1. It is impossible for a linear program with unbounded feasible region to have a unique optimal solution. True or False?
2. It is impossible for an integer program to have infinitely many optimal solutions. True or False?
3. When we solve an integer program with a minimization objective using Branch and Bound, we can discard a subproblem for which the optimal objective value of the associated LP is larger than the objective value of the incumbent solution. True or False?
4. If x = 1, y = 2 and x = 3, y = 6 are both optimal solutions to a bounded linear programming problem with two variables x and y, then x = 2, y = 4 must be an optimal solution to the problem. True or False?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
