Computational techniques of the simplex method

From MaRDI portal
Publication:1860337

zbMath1140.90033MaRDI QIDQ1860337

István Maros

Publication date: 20 February 2003

Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)




Related Items

Circular coloring of graphs via linear programming and tabu search, A regularized simplex method, Parallel search paths for the simplex algorithm, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms, Parallel distributed-memory simplex for large-scale stochastic LP problems, Implementing the simplex method as a cutting-plane method, with a view to regularization, Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming, Interior point methods 25 years later, Permutations in the Factorization of Simplex Bases, Computing solutions of the multiclass network equilibrium problem with affine cost functions, Interpolation-Based Model Order Reduction for Polynomial Systems, Exterior point simplex-type algorithms for linear and network optimization problems, A largest-distance pivot rule for the simplex algorithm, Efficient nested pricing in the simplex algorithm, Solving two-stage stochastic programming problems with level decomposition, Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes, Efficient optimization of the reward-risk ratio with polyhedral risk measures, Computational study of the GDPO dual phase-1 algorithm, Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems, A triangulation and fill-reducing initialization procedure for the simplex algorithm, Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation, Feasibility pump 2.0


Uses Software