Using central prices in the decomposition of linear programs

A decomposition technique for solving the master program of large structured linear programming problems which offers faster convergence is presented. The technique generates cuts close to the analytic center of the solution set localization resulting in iterations with decreasing set localizations. The effectivity of the technique lies in its use of balanced central prices against conventional optimal price combinations of subproblems.