| Article ID: | iaor20014180 |
| Country: | Serbia |
| Volume: | 11 |
| Issue: | 1 |
| Start Page Number: | 31 |
| End Page Number: | 39 |
| Publication Date: | Jan 2001 |
| Journal: | Yugoslav Journal of Operations Research |
| Authors: | Stojkovi Neboja V. |
| Keywords: | duality, interior point methods |
In this paper we propose a modification of the finite termination algorithm which reduces the dimension of the primal–dual linear programming problem. We note that the similar approach is possible in any primal–dual algorithm for linear programming.