A note on ``An improved initial basis for the simplex algorithm
From MaRDI portal
A note on ``An improved initial basis for the simplex algorithm''
Recommendations
- An improved initial basis for the simplex algorithm
- A basis-defiency-allowing variation of the simplex method for linear programming
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- Algebraic simplex initialization combined with the nonfeasible basis method
- A note on the simplex-cosimplex problem
- Implementing the Simplex Method: The Initial Basis
- On the simplex algorithm initializing
- A note on the distribution of the number of simplex iterations to optimality
- Some notes on the nonlinear simplex method
- scientific article; zbMATH DE number 1504438
Cites work
Cited in
(10)- An overview on the simplex algorithm
- A note on two direct methods in linear programming
- On the simplex algorithm initializing
- Algebraic simplex initialization combined with the nonfeasible basis method
- Artificial-free simplex algorithm based on the non-acute constraint relaxation
- On simplex method with most-obtuse-angle rule and cosine rule
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
- MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
- The complex interior-boundary method for linear and nonlinear programming with linear constraints
This page was built for publication: A note on ``An improved initial basis for the simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883303)
