Pages that link to "Item:Q4376475"
From MaRDI portal
The following pages link to Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach (Q4376475):
Displaying 12 items.
- Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
- A note on ``An improved initial basis for the simplex algorithm'' (Q883303) (← links)
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy (Q1406107) (← links)
- Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham (Q1663601) (← links)
- Linearly constrained global optimization: a general solution algorithm with applications. (Q1855939) (← links)
- A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← 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)
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method (Q2571997) (← links)
- Interior-point methods for linear programming: a review (Q3150491) (← links)
- A validation and verification tool for global optimization solvers (Q3598649) (← links)
- Performance evaluation of a family of criss-cross algorithms for linear programming (Q4806913) (← links)
