We propose the pairing of Lagrangian relaxation with Benders decomposition.
The developed algorithm is a dynamic convexification scheme.
The method yields stronger bounds than any LP relaxation.
We apply the algorithm towards a single-price maker strategic bidding problem.
We provide case studies for El Salvador, Honduras, and Nicaragua.