Solving the control problem for a system with a buffer store

A decompositional method is developed for solving a linear programming problem with a block structure and vertical borders. The theoretical rate of convergence is the same as in the simplex method with group steps. The method is effective in control of a system whose sequence of stationary states is linked through buffer stores.