Benders decomposition applied to multi-commodity, multi-mode distribution planning

We discuss the solution of a multi-commodity, multi-mode distribution planning problem arising in tactical level supply chain decisions, with using a primal decomposition algorithm, namely, the Benders decomposition. We provide a detailed Benders reformulation of the problem and illustrate the procedure on an example scenario. Benders algorithm, when experimented on this scenario converged to the original MIP solution showing the Benders reformulation of the problem is valid.