An implementation of the revised simplex algorithm in CUDA for solving linear optimization problems in the form max{c*x | A*x=b, l<=x<=u}
-
Updated
Dec 9, 2016 - Cuda
An implementation of the revised simplex algorithm in CUDA for solving linear optimization problems in the form max{c*x | A*x=b, l<=x<=u}
Add a description, image, and links to the revised-simplex-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the revised-simplex-algorithm topic, visit your repo's landing page and select "manage topics."