A strongly-polynomial algorithm for solving the general problem of least modules

The algorithm of polynomial algebraic complexity (a strongly-polynomial algorithm) to solve a classical problem of mathematical programming concerning minimization of the weighted sum of modules of part of variables with linear constraints (equalities imposed on all variables) has been substantiated. The algorithm is given in its explicit form. The estimation of the algorithm complexity is presented. The simulation has been carried out.