The Criss-Cross Method for Solving Linear Programming Problems

DOI10.1287/mnsc.15.7.426zbMath1231.90294MaRDI QIDQ3115906

Stanley Zionts

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

Mathematics Subject Classification ID

90C05: Linear programming

Related Items

Some generalizations of the criss-cross method for quadratic programming, A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING, Variants of the Hungarian method for solving linear programming problems, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, The sagitta method for solving linear programs, An exponential example for Terlaky's pivoting rule for the criss-cross simplex method, A finite crisscross method for oriented matroids, The mixed cutting plane algorithm for all-integer programming, A new algorithm for quadratic programming, On the finiteness of the criss-cross method, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Pivot rules for linear programming: A survey on recent theoretical developments, Criss-cross methods: A fresh view on pivot algorithms, New variants of finite criss-cross pivot algorithms for linear programming, A phase-1 approach for the generalized simplex algorithm, A projective simplex algorithm using LU decomposition, One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming, The role of pivoting in proving some fundamental theorems of linear algebra, A convergent criss-cross method