| Article ID: | iaor20001123 |
| Country: | China |
| Volume: | 17 |
| Issue: | 3 |
| Start Page Number: | 272 |
| End Page Number: | 281 |
| Publication Date: | Aug 1995 |
| Journal: | Mathematica Numerica Sinica |
| Authors: | Wu F., Ye Y., Lu X.M. |
According to the homogeneous and self-dual linear programming model and the reduced characteristic of primal–dual potential function, the authors give a generalized predictor–corrector algorithm for linear programming, and prove that the algorithm's polynomial complexity is