A note on two direct methods in linear programming

DOI10.1016/S0377-2217(03)00425-9MaRDI QIDQ1827666zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On simplex method with most-obtuse-angle rule and cosine rule
• A note on ``An improved initial basis for the simplex algorithm
• Practical finite pivoting rules for the simplex method
• Pivot rules for linear programming: A survey on recent theoretical developments
• New variants of finite criss-cross pivot algorithms for linear programming

Cites work

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

Cited in

(4)

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

Describes a project that uses

Uses Software

• HOPDM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827666)