| Article ID: | iaor19971558 |
| Country: | Netherlands |
| Volume: | 62 |
| Issue: | 1 |
| Start Page Number: | 565 |
| End Page Number: | 572 |
| Publication Date: | Mar 1996 |
| Journal: | Annals of Operations Research |
| Authors: | Ye Yinyu, Vavasis Stephen A. |
The authors propose a sufficient condition that allows an optimal basis to be identified from a central path point in a linear programming problem. This condition can be applied when there is a ‘gap’ in the sorted list of slack values. Unlike previously known conditions, this condition is valid for real-number data and does not involve the number of bits in the data.