A note on ``An improved initial basis for the simplex algorithm

DOI10.1016/j.cor.2006.02.004zbMath1165.90566OpenAlexW2081083555MaRDI QIDQ883303

Jian-Feng Hu

Publication date: 4 June 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.004

zbMATH Keywords

linear programmingsimplex algorithmbasislu decomposition

Mathematics Subject Classification ID

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

Related Items (8)

Algebraic simplex initialization combined with the nonfeasible basis method ⋮ On the simplex algorithm initializing ⋮ Artificial-free simplex algorithm based on the non-acute constraint relaxation ⋮ Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis ⋮ On simplex method with most-obtuse-angle rule and cosine rule ⋮ 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 ⋮ An overview on the simplex algorithm

Uses Software

• MarPlex

Cites Work

• Unnamed Item
• Practical finite pivoting rules for the simplex method
• An improved initial basis for the simplex algorithm
• Two direct methods in linear programming

This page was built for publication: A note on ``An improved initial basis for the simplex algorithm