| Article ID: | iaor19971545 |
| Country: | India |
| Volume: | 16 |
| Issue: | 3 |
| Start Page Number: | 585 |
| End Page Number: | 591 |
| Publication Date: | Sep 1995 |
| Journal: | Journal of Information & Optimization Sciences |
| Authors: | Singh J.N., Ranjan Shashi, Singh D. |
| Keywords: | computational analysis |
In this note the authors have proposed a modified termination rule for Karmarkar’s algorithm for linear programming. It enables the algorithm to save a large number of iterations (about 80 percent) and ensure its early termination compared to that of Karmarkar.