Linking linear feasibility and linear programming.

This paper presents an algorithm based on strongly polynomial linear feasibility queries which solves linear programming. Despite that the complexity of the algorithm is not established, discussion shows the potential of the algorithm. In addition, some ideas are presented as potential ways to find if the algorithm is or is not a strongly polynomial time solver for linear programs.