The authors propose a method for solving a linear programming problem with a large number of variables. It is assumed that the problem can be decomposed into blocks. It is also assumed that the structure of the blocks is known from the results of a preliminary solution of the problem as a whole, under conditions which are close to the computational ones. The authors prove convergence of the method, and show an application to planning and control of the transportation provided by civil aviation.