Pages that link to "Item:Q1342283"

The following pages link to The simplex algorithm with a new primal and dual pivot rule (Q1342283):

Displaying 21 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• The double pivot simplex method (Q684156) (← links)
• A primal-dual simplex method for linear programs (Q688212) (← links)
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
• Canonical bases in linear programming (Q908850) (← links)
• The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
• A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (Q1095028) (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
• Resolution of the problem of degeneracy in a primal and dual simplex algorithm (Q1374385) (← links)
• An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522) (← links)
• A minimum-ratio-test-free approach to linear programming (Q1823855) (← links)
• A new efficient primal dual simplex algorithm (Q1868820) (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) (← links)
• A largest-distance pivot rule for the simplex algorithm (Q2463487) (← 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)
• A Fast Algorithm for Linear Programming (Q3110369) (← links)
• A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm† (Q3620911) (← links)
• A Monotonic Build-Up Simplex Algorithm for Linear Programming (Q4305758) (← links)
• Dual–primal algorithm for linear optimization (Q4924118) (← links)
• Anstreicher–Terlaky type monotonic simplex algorithms for linear feasibility problems (Q5436927) (← links)