The Criss-Cross Method for Solving Linear Programming Problems

DOI10.1287/MNSC.15.7.426MaRDI QIDQ3115906zbMATH OpenOpenAlexFDO

Authors 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

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 3934764
• scientific article; zbMATH DE number 3898608
• scientific article; zbMATH DE number 5011461
• scientific article; zbMATH DE number 2047294
• A method of solving the general problem of linear programming
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• scientific article; zbMATH DE number 883355
• The sagitta method for solving linear programs
• scientific article; zbMATH DE number 4211801

Cited in

(32)

• 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
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming
• A projective simplex algorithm using LU decomposition
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
• 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
• An affine-scaling pivot algorithm for linear programming
• scientific article; zbMATH DE number 5011461 (Why is no real title available?)
• A convergent criss-cross method
• Some generalizations of the criss-cross method for quadratic programming
• Improving a primal–dual simplex-type algorithm using interior point methods
• A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING
• Artificial-free simplex algorithm based on the non-acute constraint relaxation
• Variants of the Hungarian method for solving linear programming problems
• Exterior point simplex-type algorithms for linear and network optimization problems
• Finiteness of Criss-Cross Method in Complementarity Problem
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
• Multiple faces of optimization. A tribute to Tamás Terlaky on his 70th birthday
• MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
• The sagitta method for solving linear programs
• Exact methods for large-scale multi-period financial planning problems
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

This page was built for publication: The Criss-Cross Method for Solving Linear Programming Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115906)