An efficient search direction for linear programming problems

DOI10.1016/S0305-0548(00)00069-1MaRDI QIDQ5955478zbMATH OpenFDO

Authors Hsing Paul Luh, Ray Tsaih

Publication date 13 February 2002

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

Full work available at URL https://doi.org/10.1016/S0305-0548(00)00069-1

zbMATH Keywords

interior-point-based solution

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 4197738
• An improved initial basis for the simplex algorithm
• Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.
• Some fundamental issues of basic line search algorithm for linear programming problems
• A feasible direction method for linear programming

Cites work

• A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
• A Family of Search Directions for Karmarkar's Algorithm
• A new polynomial-time algorithm for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Combining Interior-Point and Pivoting Algorithms for Linear Programming
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• scientific article; zbMATH DE number 439946 (Why is no real title available?)
• Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods

Cited in

(19)

• Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.
• Efficient searching with linear constraints
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• An improved initial basis for the simplex algorithm
• Some fundamental issues of basic line search algorithm for linear programming problems
• scientific article; zbMATH DE number 3858835 (Why is no real title available?)
• scientific article; zbMATH DE number 4216294 (Why is no real title available?)
• scientific article; zbMATH DE number 4158377 (Why is no real title available?)
• scientific article; zbMATH DE number 4083352 (Why is no real title available?)
• An improved targeted climbing algorithm for linear programs
• scientific article; zbMATH DE number 1014687 (Why is no real title available?)
• A hybrid direction algorithm for solving linear programs
• scientific article; zbMATH DE number 4197738 (Why is no real title available?)
• A line search improvement of efficient MPC
• MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
• A feasible direction method for linear programming
• The complex interior-boundary method for linear and nonlinear programming with linear constraints

This page was built for publication: An efficient search direction for linear programming problems

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