Computational techniques of the simplex method
From MaRDI portal
Publication:1860337
zbMath1140.90033MaRDI QIDQ1860337
Publication date: 20 February 2003
Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
90Cxx: Mathematical programming
Related Items
Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems, Interior point methods 25 years later, Efficient nested pricing in the simplex algorithm, Computational study of the GDPO dual phase-1 algorithm, Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation, Feasibility pump 2.0, A largest-distance pivot rule for the simplex algorithm, Solving two-stage stochastic programming problems with level decomposition, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes
Uses Software