scientific article; zbMATH DE number 3206575
From MaRDI portal
Publication:5332463
zbMath0127.08203MaRDI QIDQ5332463
Richard E. Quandt, Harold W. Kuhn
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic programmingsimplex methodCDC-1604 Institute for Defense Analysis Princetonmodified basic gradient method
Numerical mathematical programming methods (65K05) Linear programming (90C05) Stochastic programming (90C15)
Related Items
A simplex-like method with bisection for linear programming1 ⋮ On the choice of the pivot columns of the simplex-method: Gradient criteria ⋮ A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps ⋮ Heights of convex polytopes ⋮ Computational behavior of a feasible direction method for linear programming ⋮ Worst case behavior of the steepest edge simplex method ⋮ Laws of large numbers for random linear programs ⋮ Zur Anzahl der Schlupfvariablen in der Optimallösung bei der linearen Optimierung ⋮ Proximate linear programming: A variable extreme point method ⋮ Experiments with external pivoting ⋮ A simple heuristic approach to simplex efficiency ⋮ Pivot selection methods of the Devex LP code ⋮ Computational results of an interior point algorithm for large scale linear programming ⋮ A largest-distance pivot rule for the simplex algorithm ⋮ Efficient nested pricing in the simplex algorithm ⋮ On scaling linear programs—some experimental results ⋮ A computational study of redundancy in randomly generated polytopes ⋮ Complexity of the gravitational method for linear programming ⋮ Steepest-edge rule and its number of simplex iterations for a nondegenerate LP ⋮ A practicable steepest-edge simplex algorithm ⋮ Steepest-edge simplex algorithms for linear programming ⋮ Reinforcement learning of simplex pivot rules: a proof of concept ⋮ Solving staircase linear programs by the simplex method, 2: Pricing ⋮ Adjacent vertex simplex algorithms: More experimental results on random problems
