Direct multiplicative methods for sparse matrices. Linear programming
Multiplicative methods for sparse matrices are best suited to reduce the complexity of operations solving systems of linear equations performed on each iteration of the simplex method. The matrix of constraints in these problems of sparsely populated nonzero elements, which allows to obtain the mult...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Institute of Computer Science
2017-04-01
|
| Series: | Компьютерные исследования и моделирование |
| Subjects: | |
| Online Access: | http://crm.ics.org.ru/uploads/crmissues/crm_2017_2/2017_02_02.pdf |