Recovery of Dual Variables in Generalized Benders Decomposition

摘要

Direct application of Generalized Benders Decomposition to convex programing problems does not yield the dual variables as part of the solution. Simple computational formulas for recovering the dual variables are presented, and it is shown that the convergence criterion for the decomposition determines the accuracy of the computed dual prices. (ERA citation 05:003946)