Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs
From MaRDI portal
Publication:5736645
DOI10.1287/OPRE.12.1.161zbMATH Open0123.37204OpenAlexW2113150272MaRDI QIDQ5736645FDOQ5736645
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
Cited In (6)
- A computational approach to pivot selection in the LP relaxation of set problems
- Randomly generated polytopes for testing mathematical programming algorithms
- 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
- Berechnung stochastischer Termine
- 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)
