Algorithm behind standard pulp solver

Question

I'm currently working on an LP optimization problem with and looked into PuLP.

I know that PuLPs default solver is: PULP-CBC-CMD. I solved a test problem with this and I'm wondering what kind of algorithm this solver actually uses... it doesnt seem to be a simplex as my problem got interpreted completely differently than a simplex interpretion would look like?

Also: Every other solver for PuLP has to be added to PuLP manually right?

Also: what solvers are you guys working with in python?

Thanks in advance!

Answer 1

CBC is based on simplex, yes. But, like most solvers, it combines simplex with many other algorithms such as branch-and-bound and cut-generation.

In particular, to solve linear programs it uses Clp: https://github.com/coin-or/Clp

More information on the CBC solver in their site: https://github.com/coin-or/Cbc