Pages that link to "Item:Q1810522"

The following pages link to An efficient simplex type algorithm for sparse and dense linear programs. (Q1810522):

Displaying 11 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
• A new efficient primal dual simplex algorithm (Q1868820) (← links)
• A two-phase support method for solving linear programs: numerical experiments (Q1954826) (← links)
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs (Q2371471) (← links)
• An improved initial basis for the simplex algorithm (Q2387247) (← links)
• An experimental investigation of a primal–dual exterior point simplexalgorithm (Q2868925) (← links)
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming (Q3454862) (← links)
• Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
• Deepest point of a polyhedron and linear programming (Q4981863) (← links)
• A hybrid direction algorithm for solving linear programs (Q4983278) (← links)