Name
Abstract | ||
|---|---|---|
The linear programming algorithm of Karmarkar (1984), and all interior methods subsequently devised, require a regularity assumption that the primal and/or dual problem possess a nonempty interior. In this note we devise a polynomial-time interior algorithm which will directly 'process' and linear program, with no regularity assumptions whatsoever, without the addition of any 'M' terms. Our method is based on the application of a combined phase I-phase II algorithm to a combined primal-dual problem. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0167-6377(92)90026-Y | Operations Research Letters |
Keywords | Field | DocType |
linear program,linear programming | Mathematical optimization,Linear programming algorithm,Algorithm,Duality (optimization),Linear programming,Karmarkar's algorithm,Time complexity,Interior point method,Mathematics | Journal |
Volume | Issue | ISSN |
11 | 4 | 0167-6377 |
Citations | PageRank | References |
3 | 0.56 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kurt M. Anstreicher | 1 | 633 | 86.40 |