Pages that link to "Item:Q1342283"

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

Displaying 8 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
• The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← 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 new efficient primal dual simplex algorithm (Q1868820) (← links)
• A projective simplex algorithm using LU decomposition (Q1975340) (← links)