Local decomposition methods for linear programming

Abstract The paper proposes decomposition methods for primal and dual block-angular systems. The decomposition used is called local because it depends on the basic solution considered. The entire problem is decomposed into a principal problem and independent subproblems. In the dual and primal local decomposition methods, parametric solutions to the subproblems are interacting with the principal problem.