Pages that link to "Item:Q1129474"

The following pages link to A dual projective simplex method for linear programming (Q1129474):

Displaying 8 items.

• Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis (Q668136) (← links)
• A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
• A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← 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)
• 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)
• An affine-scaling pivot algorithm for linear programming (Q2841137) (← links)