Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
From MaRDI portal
Publication:668136
DOI10.1016/J.AMC.2015.06.080zbMATH Open1410.90124OpenAlexW909193692MaRDI QIDQ668136FDOQ668136
Ping-Qi Pan, Lili Zhang, Yanqin Ma
Publication date: 18 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2015.06.080
Recommendations
- scientific article
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- Performance evaluation of a family of criss-cross algorithms for linear programming
- A primal deficient-basis simplex algorithm for linear programming
- New variants of finite criss-cross pivot algorithms for linear programming
Cites Work
- A phase-1 approach for the generalized simplex algorithm
- A basis-defiency-allowing variation of the simplex method for linear programming
- A note on ``An improved initial basis for the simplex algorithm
- A convergent criss-cross method
- A simple direct cosine simplex algorithm
- The Criss-Cross Method for Solving Linear Programming Problems
- On simplex method with most-obtuse-angle rule and cosine rule
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- Phase I cycling under the most-obtuse-angle pivot rule
- A Variant of the Dual Pivoting Rule in Linear Programming
- A dual projective simplex method for linear programming
- An affine-scaling pivot algorithm for linear programming
- Title not available (Why is that?)
- Dual–primal algorithm for linear optimization
Cited In (2)
Uses Software
This page was built for publication: Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668136)
