Abstract
The simple linear programming algorithms have appeared from the generalization of Von Neumann ideas. The main advantage of such algorithms is the simplicity, that is, in each iteration, it is only needed to perform matrix vector multiplications and solve positive definite linear systems of small dimension, On the other hand, the continued iteration consists in projecting the search direct…