Pages that link to "Item:Q2387247"
From MaRDI portal
The following pages link to An improved initial basis for the simplex algorithm (Q2387247):
Displaying 22 items.
- A new local dimming algorithm based on the simplex method (Q276871) (← links)
- Algebraic simplex initialization combined with the nonfeasible basis method (Q319588) (← links)
- Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
- On simplex method with most-obtuse-angle rule and cosine rule (Q548344) (← links)
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1 (Q840613) (← links)
- A note on ``An improved initial basis for the simplex algorithm'' (Q883303) (← links)
- Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems (Q903045) (← links)
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- Improvement and its computer implementation of an artificial-free simplex-type algorithm by Arsham (Q1663601) (← links)
- Scheduling quay cranes and yard trucks for unloading operations in container ports (Q1730674) (← links)
- On the simplex algorithm initializing (Q1938217) (← 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 simple direct cosine simplex algorithm (Q2391301) (← links)
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis (Q2802253) (← links)
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (Q2941509) (← links)
- (Q3137560) (← links)
- Implementing the Simplex Method: The Initial Basis (Q4030926) (← links)
- Formalization of Incremental Simplex Algorithm by Stepwise Refinement (Q4647860) (← links)
- A slight modification of the first phase of the simplex algorithm (Q5259328) (← links)