Computational behavior of a feasible direction method for linear programming

DOI10.1016/0377-2217(89)90424-4zbMath0671.90069OpenAlexW2152532279MaRDI QIDQ1119474

Katta G. Murty, Yahya Fathi

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/27884

zbMATH Keywords

approximationMonte Carlo optimizationpure adaptive search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items (4)

Experiments with external pivoting ⋮ A computational study of redundancy in randomly generated polytopes ⋮ 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

• A feasible direction method for linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational behavior of a feasible direction method for linear programming