Computational techniques of the simplex method

From MaRDI portal
Revision as of 12:23, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 searchA regularized simplex methodParallel search paths for the simplex algorithmProgress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithmsParallel distributed-memory simplex for large-scale stochastic LP problemsImplementing the simplex method as a cutting-plane method, with a view to regularizationInfeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear ProgrammingInterior point methods 25 years laterPermutations in the Factorization of Simplex BasesComputing solutions of the multiclass network equilibrium problem with affine cost functionsInterpolation-Based Model Order Reduction for Polynomial SystemsExterior point simplex-type algorithms for linear and network optimization problemsA largest-distance pivot rule for the simplex algorithmEfficient nested pricing in the simplex algorithmSolving two-stage stochastic programming problems with level decompositionCentral Path Curvature and Iteration-Complexity for Redundant Klee—Minty CubesEfficient optimization of the reward-risk ratio with polyhedral risk measuresComputational study of the GDPO dual phase-1 algorithmAnstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problemsA triangulation and fill-reducing initialization procedure for the simplex algorithmProgress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementationFeasibility pump 2.0


Uses Software