This article describes a computational process for solving a transport problem with additional constraints. The rationale for the described algorithm is contained in [1]. A similar algorithm is also described in [2], in which it is proposed to build and solve a system of linear equations of order L at each step of improving the plan, where L is the number of additional constraints. An algorithm is proposed below, which uses the inverse matrix of the mentioned system and specifies the method of its transformation when improving the plan. Using the inverse matrix allows you to solve problems with a large number of additional constraints. For simplicity, the article considers the transport problem in matrix form, but with a slight complication, the algorithm can be applied to solve distribution problems with additional constraints in both matrix and network form.