Comments on a note by T. L. Saaty (“A Conjecture Concerning the Smallest Bound on the Iterations in Linear Programming,” Opns. Res., 11, 151–153 (1963).
Richard E. Quandt, Harold W. Kuhn, (1964) Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs. Operations Research 12(1):161-165.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.