|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 2010, Volume 13, Number 2, Pages 161–181
(Mi sjvm275)
|
|
|
|
A strongly-polynomial algorithm for solving the general problem of least modules
V. V. Mironov Ryazan State Radio Engineering University, Ryazan
Abstract:
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.
Key words:
algorithm, complexity of algorithm, least modules.
Received: 24.09.2008 Revised: 11.06.2009
Citation:
V. V. Mironov, “A strongly-polynomial algorithm for solving the general problem of least modules”, Sib. Zh. Vychisl. Mat., 13:2 (2010), 161–181; Num. Anal. Appl., 3:2 (2010), 133–150
Linking options:
https://www.mathnet.ru/eng/sjvm275 https://www.mathnet.ru/eng/sjvm/v13/i2/p161
|
|