An overview on the simplex algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1064581
- scientific article; zbMATH DE number 4027159
- scientific article; zbMATH DE number 653033
- Simplex algorithms for linear programming
- Fresh views on some recent developments in the simplex algorithm
- Linear programming, the simplex algorithm and simple polytopes
- On the simplex algorithm initializing
- The Efficiency of the Simplex Method: A Survey
- The complexity of the simplex method
- scientific article; zbMATH DE number 3889289
Cites work
- scientific article; zbMATH DE number 3167494 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1546510 (Why is no real title available?)
- scientific article; zbMATH DE number 3069632 (Why is no real title available?)
- A new efficient primal dual simplex algorithm
- A note on ``An improved initial basis for the simplex algorithm
- A practicable steepest-edge simplex algorithm
- Linear Programming
- Linear Programming
- The many facets of linear programming
Cited in
(8)- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- A computationally stable solution algorithm for linear programs
- On the simplex algorithm initializing
- Algebraic simplex initialization combined with the nonfeasible basis method
- An algorithm for simplex tableau reduction: The push-to-pull solution strategy
- A two-phase method for the simplex tableau
- A generalized objective function based on weight coefficient for topology-finding of tensegrity structures
- A simple and practical simplex tabuleau
This page was built for publication: An overview on the simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1021548)