| Article ID: | iaor19981917 |
| Country: | China |
| Volume: | 16 |
| Issue: | 3 |
| Start Page Number: | 211 |
| End Page Number: | 227 |
| Publication Date: | Jul 1996 |
| Journal: | Journal of Systems Science and Applied Sciences |
| Authors: | Lu X.M. |
| Keywords: | interior point methods |
Starting with the simplex method and long step path following algorithm, the author introduces an interior point algorithm with combinatorial characteristics for linear programming with inequality constraints. This method retains the advantages of the simplex method and interior method, and overcomes their deficiencies. In any case, this method can terminate rapidly. The numerical results show the method to be effective.