An efficient search direction for linear programming problems

DOI10.1016/S0305-0548(00)00069-1zbMath1032.90018MaRDI QIDQ5955478

Hsing Paul Luh, Ray Tsaih

Publication date: 13 February 2002

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

zbMATH Keywords

interior-point-based solution

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

An improved initial basis for the simplex algorithm, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih., 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, A triangulation and fill-reducing initialization procedure for the simplex algorithm

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
• A Family of Search Directions for Karmarkar's Algorithm
• Combining Interior-Point and Pivoting Algorithms for Linear Programming
• A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm