Name
Abstract | ||
|---|---|---|
We devise a projective algorithm which explicitly considers the constraint that an artificial variable be zero at the solution. Inclusion of such a constraint allows the algorithm to be applied to a (possibly infeasible) standard form linear program, without the addition of any “bigM“ terms or conversion to a primal-dual problem. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1007/BF01582290 | Math. Program. |
Keywords | Field | DocType |
artificial variable,projective algorithm,linear programming,i-phase ii projective algorithm,combined phase,karmarkar's algorithm,phase i.,dual problem,linear program | Constraint satisfaction,Mathematical optimization,Upper and lower bounds,Algorithm,Projection method,Duality (optimization),Linear programming,Karmarkar's algorithm,Difference-map algorithm,Mathematics,Hybrid algorithm (constraint satisfaction) | Journal |
Volume | Issue | ISSN |
43 | 2 | 0025-5610 |
Citations | PageRank | References |
16 | 4.37 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kurt M. Anstreicher | 1 | 633 | 86.40 |