Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs

DOI10.1287/OPRE.12.1.161MaRDI QIDQ5736645zbMATH OpenOpenAlexFDO

Authors Richard E. Quandt, Harold W. Kuhn

Publication date 1964

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.12.1.161

zbMATH Keywords

operations research

Cited in

(6)

• A computational approach to pivot selection in the LP relaxation of set problems
• Berechnung stochastischer Termine
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• On the choice of the pivot columns of the simplex-method: Gradient criteria
• Randomly generated polytopes for testing mathematical programming algorithms
• A class of linear programming problems requiring a large number of iterations

This page was built for publication: Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5736645)