Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.

DOI10.1016/S0305-0548(02)00110-7zbMath1048.90133OpenAlexW2000111847MaRDI QIDQ1413819

Bruce J. Chaderjian, Tang'an Gao

Publication date: 17 November 2003

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00110-7

zbMATH Keywords

Linear programmingInterior-point-based solution

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (2)

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

Cites Work

• An efficient search direction for linear programming problems
• Unnamed Item

This page was built for publication: Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.