Abstract | ||
---|---|---|
We develop an extension of the affinely scaled potential reduction algorithm which simultaneously obtains feasibility and optimality in a standard form linear program, without the addition of any “M” terms. The method, and its lower-bounding procedure, are particularly simple compared with previous interior algorithms not requiring feasibility. |
Year | DOI | Venue |
---|---|---|
1991 | 10.1007/BF01582899 | Math. Program. |
Keywords | Field | DocType |
i-phase ii,phase ii,potential algorithm,linear programming,potential function,phase i,combined phase,artificial variable.,lower bound,linear program | Linear-fractional programming,Mathematical optimization,Algorithm,Linear programming,Mathematics | Journal |
Volume | Issue | ISSN |
52 | 3 | 0025-5610 |
Citations | PageRank | References |
6 | 3.88 | 13 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kurt M. Anstreicher | 1 | 633 | 86.40 |