Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis

DOI10.1016/j.amc.2015.06.080zbMath1410.90124OpenAlexW909193692MaRDI QIDQ668136

Yanqin Ma, Ping-Qi Pan, Li-Li Zhang

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

zbMATH Keywords

criss-crossdeficient basismost-obtuse-angle

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Uses Software

• MarPlex

Cites Work

• On simplex method with most-obtuse-angle rule and cosine rule
• A note on ``An improved initial basis for the simplex algorithm
• A dual projective simplex method for linear programming
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• A phase-1 approach for the generalized simplex algorithm
• A basis-defiency-allowing variation of the simplex method for linear programming
• A simple direct cosine simplex algorithm
• A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
• Phase I cycling under the most-obtuse-angle pivot rule
• An affine-scaling pivot algorithm for linear programming
• The Criss-Cross Method for Solving Linear Programming Problems
• A convergent criss-cross method
• A Variant of the Dual Pivoting Rule in Linear Programming
• Dual–primal algorithm for linear optimization
• Unnamed Item

This page was built for publication: Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis