A sub-problem in a B & B is solved and found infeasible. Should the B & B algorithm continue further analysis on this candidate problem?
A) Yes, a feasible solution may be found when additional constraints are added.
B) Yes, removing a constraint in further analysis may restore feasibility.
C) No, adding more constraints will not restore problem feasibility.
D) No, the result cannot occur so re-examine the formulation and start over.

Question

Quizplus · Accepted Answer

In a Branch and Bound (B&B) algorithm, if a sub-problem is found to be infeasible, there is no point in continuing further analysis on that specific candidate problem because adding more constraints will not make an infeasible problem feasible.

A Sub-Problem in a B & B Is Solved and Found