Article ID: | iaor19961796 |
Country: | India |
Volume: | 32 |
Issue: | 3 |
Start Page Number: | 184 |
End Page Number: | 204 |
Publication Date: | Sep 1995 |
Journal: | OPSEARCH |
Authors: | Lassez J.L., Prabhu N. |
Keywords: | duality |
By constructing the quasidual of a system of linear inequalities, the authors show that a quadratic number of Simplex pivoting operations are sufficient to solve a general Linear Programming problem. A pivot rule that actually performs the correct pivoting operation in each step, remains to be discovered.