1. The problem statement, all variables and given/known data I'm trying to learn the Branch and Bound method. For that, I need to master the Dual Simplex Method (DSA). I have tried and tried and tried to google examples but can't find any. Does anyone know where I can find any? How do you know the LPP has become infeasible with the DSA?