Algebraic simplex initialization combined with the nonfeasible basis method
From MaRDI portal
Recommendations
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- An overview on the simplex algorithm
- A new method of avoiding artificial variables for achieving an initial feasible basis of a linear programming
- An artificial-free simplex-type algorithm for general LP models
- An improved initial basis for the simplex algorithm
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 1546510 (Why is no real title available?)
- scientific article; zbMATH DE number 195106 (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
- An overview on the simplex algorithm
- Linear Programming
- Linear Programming
- The \(s\)-monotone index selection rules for pivot algorithms of linear programming
- The many facets of linear programming
- Two direct methods in linear programming
Cited in
(3)
This page was built for publication: Algebraic simplex initialization combined with the nonfeasible basis method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319588)