Pages that link to "Item:Q751498"

The following pages link to Practical finite pivoting rules for the simplex method (Q751498):

Displaying 47 items.

• Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
• On simplex method with most-obtuse-angle rule and cosine rule (Q548344) (← links)
• The double pivot simplex method (Q684156) (← links)
• A note on ``An improved initial basis for the simplex algorithm'' (Q883303) (← links)
• Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems (Q903045) (← links)
• Experiments with external pivoting (Q909578) (← links)
• An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
• Efficient nested pricing in the simplex algorithm (Q943787) (← links)
• A computational approach to pivot selection in the LP relaxation of set problems (Q955467) (← links)
• A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (Q1095028) (← links)
• On the choice of the pivot columns of the simplex-method: Gradient criteria (Q1097836) (← links)
• Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples (Q1121785) (← links)
• A dual projective simplex method for linear programming (Q1129474) (← links)
• A new pivoting rule for solving various degeneracy problems (Q1198621) (← links)
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
• Selected bibliography on degeneracy (Q1312748) (← links)
• Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• The simplex algorithm with a new primal and dual pivot rule (Q1342283) (← 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)
• A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
• A note on two direct methods in linear programming (Q1827666) (← 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)
• Reinforcement learning of simplex pivot rules: a proof of concept (Q2080843) (← links)
• A largest-distance pivot rule for the simplex algorithm (Q2463487) (← links)
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) (← links)
• A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
• Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
• On the existence of a short admissible pivot sequence for feasibility and linear optimization problems (Q2707294) (← links)
• The role of the pivot technique in the proof of some fundamental theorems of linear algebra. (Q2756261) (← links)
• Finiteness of the quadratic simplex method with the application of index selection rules (Q2834253) (← links)
• An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)
• An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (Q2941509) (← links)
• Markov decision processes for infinite horizon problems solved with the cosine simplex method (Q3165917) (← links)
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
• Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix (Q3542358) (← links)
• On practical stopping rules for the simplex method (Q3777794) (← links)
• A simplex-like method with bisection for linear programming¹ (Q3979523) (← links)
• A Monotonic Build-Up Simplex Algorithm for Linear Programming (Q4305758) (← links)
• A Variant of the Dual Pivoting Rule in Linear Programming (Q4321114) (← links)
• (Q4850033) (← links)
• Dual–primal algorithm for linear optimization (Q4924118) (← links)
• (Q5399132) (← links)