|
This article is cited in 1 scientific paper (total in 1 paper)
An algorithm of the simplex method using a dual basis
G. I. Zabinyako Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 6 Lavrentiev pr., Novosibirsk, 630090, Russia
Abstract:
An algorithm of the simplex method not requiring an explicit updating of the $LU$ decomposition in iterations is considered. Solutions obtained with fixed $LU$ factors are corrected using small auxiliary matrices. The results of numerical experiments are presented.
Key words:
$LU$-decomposition, decomposition updating, sparse matrices, simplex method, linear programming.
Received: 05.03.2015 Revised: 13.04.2015
Citation:
G. I. Zabinyako, “An algorithm of the simplex method using a dual basis”, Sib. Zh. Vychisl. Mat., 18:4 (2015), 349–359; Num. Anal. Appl., 8:4 (2015), 285–292
Linking options:
https://www.mathnet.ru/eng/sjvm587 https://www.mathnet.ru/eng/sjvm/v18/i4/p349
|
Statistics & downloads: |
Abstract page: | 427 | Full-text PDF : | 161 | References: | 36 | First page: | 14 |
|