A polynomial method of approximate centers for linear programming
| ISSN: |
1436-4646
|
|---|---|
| Keywords: |
Interior-point method ; linear programming ; Karmarkar's method ; polynomial-time algorithm ; logarithmic barrier function ; path-following method
|
| Source: |
Springer Online Journal Archives 1860-2000
|
| Topics: |
Computer Science
Mathematics
|
| Notes: |
Abstract We present a path-following algorithm for the linear programming problem with a surprisingly simple and elegant proof of its polynomial behaviour. This is done both for the problem in standard form and for its dual problem. We also discuss some implementation strategies.
|
| Type of Medium: |
Electronic Resource
|
| URL: |