A feasible direction method for linear programming

DOI10.1016/0167-6377(84)90003-8zbMath0544.90070OpenAlexW2073321775MaRDI QIDQ797493

Yahya Fathi, Katta G. Murty

Publication date: 1984

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/2027.42/24731

zbMATH Keywords

degeneracyfinite terminationfeasible direction methodprimal simplex algorithmedge directionsinterior directions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Introduction: New approaches to linear programming, All-integer column generation for set partitioning: basic principles and extensions, Solving fully fuzzy matrix equations, Computational behavior of a feasible direction method for linear programming, Experiments with external pivoting, Exterior point simplex-type algorithms for linear and network optimization problems, On linear multiplicative programming., A computational study of redundancy in randomly generated polytopes, A new efficient primal dual simplex algorithm

Cites Work

• Nonadjacent extreme point methods for solving linear programs
• Nonextreme point solution strategies for linear programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item