A note on two direct methods in linear programming

DOI10.1016/S0377-2217(03)00425-9zbMath1061.90088OpenAlexW2051531263MaRDI QIDQ1827666

Wei Li

Publication date: 6 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00425-9

zbMATH Keywords

Linear programmingMinimalangle methodDirect methodMost-obtuse-angle method

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (3)

Artificial-free simplex algorithm based on the non-acute constraint relaxation ⋮ On simplex method with most-obtuse-angle rule and cosine rule ⋮ A new least square algorithm for linear programming

Uses Software

• HOPDM

Cites Work

• Practical finite pivoting rules for the simplex method
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• A simplex-like method with bisection for linear programming¹
• A Variant of the Dual Pivoting Rule in Linear Programming
• Two direct methods in linear programming

This page was built for publication: A note on two direct methods in linear programming