Pages that link to "Item:Q1312760"

The following pages link to Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760):

Displayed 15 items.

• The sagitta method for solving linear programs (Q703904) ‎ (← links)
• Degeneracy in interior point methods for linear programming: A survey (Q1312753) ‎ (← links)
• The use of the optimal partition in a linear programming solution for postoptimal analysis (Q1342079) ‎ (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) ‎ (← links)
• Pivot versus interior point methods: Pros and cons (Q1598748) ‎ (← links)
• New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) ‎ (← links)
• A new efficient primal dual simplex algorithm (Q1868820) ‎ (← links)
• Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) ‎ (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) ‎ (← links)
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs (Q2371471) ‎ (← links)
• A computationally stable solution algorithm for linear programs (Q2372034) ‎ (← links)
• The central path visits all the vertices of the Klee–Minty cube (Q3423600) ‎ (← links)
• LPAKO: A Simplex-based Linear Programming Program (Q4709753) ‎ (← links)
• Combined projected gradient algorithm for linear programming (Q5481683) ‎ (← links)
• On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method (Q5689973) ‎ (← links)