Geodesic
The parallel simplex-method achievements for errorless solving of linear programming problems
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 9 (2011), pp. 107-118

Voir la notice de l'article provenant de la source Math-Net.Ru

Techniques of obtaining exact solutions of linear programming problems are subjects of this paper. Absolute accuracy are arrived at implementation of simplex-algorithm with exact rational-fractional computation. In this case if $m$ is minimal of problem dimensions, and $l$ is number of bits for a source data item then space complexity are no more $4lm^4+o(m^3)$, one iteration time complexity are no more $O(lm^4)$, and paralleling efficiency (i.e. ratio of acceleration to number of processors) asymptotical estimate are 100%.
Keywords: linear programming, simplex method, distributed computing, parallel computing, rational computations, optimization, arbitrary precision, interval arithmetic. 
@article{VYURU_2011_9_a10,
     author = {A. V. Panyukov and V. V. Gorbik},
     title = {The parallel simplex-method achievements for errorless solving of linear programming problems},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matemati\v{c}eskoe modelirovanie i programmirovanie},
     pages = {107--118},
     publisher = {mathdoc},
     number = {9},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURU_2011_9_a10/}
}
TY  - JOUR
AU  - A. V. Panyukov
AU  - V. V. Gorbik
TI  - The parallel simplex-method achievements for errorless solving of linear programming problems
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie
PY  - 2011
SP  - 107
EP  - 118
IS  - 9
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VYURU_2011_9_a10/
LA  - ru
ID  - VYURU_2011_9_a10
ER  - 
%0 Journal Article
%A A. V. Panyukov
%A V. V. Gorbik
%T The parallel simplex-method achievements for errorless solving of linear programming problems
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie
%D 2011
%P 107-118
%N 9
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VYURU_2011_9_a10/
%G ru
%F VYURU_2011_9_a10
A. V. Panyukov; V. V. Gorbik. The parallel simplex-method achievements for errorless solving of linear programming problems. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, no. 9 (2011), pp. 107-118. http://geodesic.mathdoc.fr/item/VYURU_2011_9_a10/