Pages that link to "Item:Q1278948"

The following pages link to The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948):

Displayed 8 items.

• A dual projective simplex method for linear programming (Q1129474) ‎ (← 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 note on two direct methods in linear programming (Q1827666) ‎ (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) ‎ (← links)
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule (Q2475881) ‎ (← links)
• Phase I cycling under the most-obtuse-angle pivot rule (Q2484337) ‎ (← links)
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) ‎ (← links)