Pages that link to "Item:Q1852251"
From MaRDI portal
The following pages link to Computational aspects of linear programming simplex method (Q1852251):
Displaying 12 items.
- The simplex method and unrestricted variables (Q790709) (← links)
- Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1 (Q840613) (← links)
- An analysis of an available set of linear programming test problems (Q1113798) (← links)
- Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham (Q1663601) (← links)
- Computational techniques of the simplex method (Q1860337) (← links)
- Computational results with a primal-dual subproblem simplex method (Q1969761) (← links)
- A simple direct cosine simplex algorithm (Q2391301) (← links)
- The Efficiency of the Simplex Method: A Survey (Q3753810) (← links)
- On practical stopping rules for the simplex method (Q3777794) (← links)
- (Q3999027) (← links)
- Implementing the Simplex Method: The Initial Basis (Q4030926) (← links)
- Implementing the simplex method for the Optimization Subroutine Library (Q4323674) (← links)