Pages that link to "Item:Q3115906"

The following pages link to The Criss-Cross Method for Solving Linear Programming Problems (Q3115906):

Displaying 29 items.

• Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis (Q668136) (← links)
• The sagitta method for solving linear programs (Q703904) (← links)
• Exact methods for large-scale multi-period financial planning problems (Q839841) (← links)
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
• A finite crisscross method for oriented matroids (Q1073036) (← links)
• The mixed cutting plane algorithm for all-integer programming (Q1092815) (← links)
• A new algorithm for quadratic programming (Q1097172) (← links)
• On the finiteness of the criss-cross method (Q1176822) (← links)
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915) (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
• New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
• A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming (Q1926882) (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) (← links)
• A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming (Q2014048) (← links)
• One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
• The role of pivoting in proving some fundamental theorems of linear algebra (Q2644727) (← links)
• An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
• A convergent criss-cross method (Q3703581) (← links)
• Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
• Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
• A NEW ADMISSIBLE PIVOT METHOD FOR LINEAR PROGRAMMING (Q4654999) (← links)
• Variants of the Hungarian method for solving linear programming problems (Q4729607) (← links)
• Finiteness of Criss-Cross Method in Complementarity Problem (Q5114998) (← links)