1

I've seen two different optimizers being used, but both with a different solver. One uses PULP_CBC_CMD and the other uses GLPKSolverMIP() can someone explain to me the difference in these two optimization strategies?

Both of these optimizers are using to optimize daily fantasy sports lineups. It's basically a knapsack optimization problem. You are give X amount of roster spots and a defined salary and must fit players from each position into their corresponding roster spot while staying under the required salary.

Austin
  • 13
  • 2

1 Answers1

2

The two solvers that you've mentioned both implement branch and bound methods for integer linear programming. The differences are at the implementation level rather than in the basic algorithms being used.

Brian Borchers
  • 18,719
  • 1
  • 39
  • 70