The Criss-Cross Method for Solving Linear Programming Problems
From MaRDI portal
Publication:3115906
DOI10.1287/mnsc.15.7.426zbMath1231.90294OpenAlexW2166826627MaRDI QIDQ3115906
Publication date: 12 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.15.7.426
Related Items
A phase-1 approach for the generalized simplex algorithm, A convergent criss-cross method, Exact methods for large-scale multi-period financial planning problems, The mixed cutting plane algorithm for all-integer programming, A new algorithm for quadratic programming, The role of pivoting in proving some fundamental theorems of linear algebra, Criss-cross methods: A fresh view on pivot algorithms, The \(s\)-monotone index selection rules for pivot algorithms of linear programming, Some generalizations of the criss-cross method for quadratic programming, Finiteness of Criss-Cross Method in Complementarity Problem, An exponential example for Terlaky's pivoting rule for the criss-cross simplex method, Artificial-free simplex algorithm based on the non-acute constraint relaxation, On the finiteness of the criss-cross method, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, A projective simplex algorithm using LU decomposition, Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis, Exterior point simplex-type algorithms for linear and network optimization problems, Improving a primal–dual simplex-type algorithm using interior point methods, A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING, The sagitta method for solving linear programs, A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, Variants of the Hungarian method for solving linear programming problems, An affine-scaling pivot algorithm for linear programming, Pivot rules for linear programming: A survey on recent theoretical developments, A finite crisscross method for oriented matroids, New variants of finite criss-cross pivot algorithms for linear programming
