Extended Cutting Plane (Westerlund-Pettersson)

Branch and Bound 1 implementation

Implementations

SHOT

Classic outer approximation: linearize at infeasible points.

TaskSelectHyperplanePointsECP Class:

  • run(): Process current MIP solutions
  • run(solPoints): Process specific solution points

ECP Algorithm:

  • Generate gradient cut at infeasible solution
  • Simpler than ESH but may converge slower
  • Used as fallback when ESH rootsearch fails