B&B and simplex algorithm

46 Views Asked by At

I'm starting studying OR, I read that when solving PLI problem it's common to use Branch and Bound techinque which "decompose" the problem and solves smaller problems. My question is the following: when solving those small problems, is used simplex algorithm? The two method are always used together? Thank you.