A feasible direction method for linear programming

DOI10.1016/0167-6377(84)90003-8MaRDI QIDQ797493zbMATH OpenOpenAlexFDO

Authors Katta G. Murty, Yahya Fathi

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)

Recommendations

• An interior feasible direction method with constraint projections for linear programming
• A steepest feasible direction extension of the simplex method
• Publication:3677504
• An efficient search direction for linear programming problems
• An improved general Phase-I method in linear programming

Cites work

• scientific article; zbMATH DE number 3943553 (Why is no real title available?)
• scientific article; zbMATH DE number 3202920 (Why is no real title available?)
• scientific article; zbMATH DE number 3284927 (Why is no real title available?)
• scientific article; zbMATH DE number 3069636 (Why is no real title available?)
• Nonadjacent extreme point methods for solving linear programs
• Nonextreme point solution strategies for linear programs

Cited in

(21)

• Pure adaptive search in Monte Carlo optimization
• Exterior point simplex-type algorithms for linear and network optimization problems
• scientific article; zbMATH DE number 3852784 (Why is no real title available?)
• A unified approach to the feasible direction methods for nonlinear programming with linear constraints
• A steepest feasible direction extension of the simplex method
• A computational study of redundancy in randomly generated polytopes
• Solving fully fuzzy matrix equations
• On linear multiplicative programming.
• Experiments with external pivoting
• Global pricing and feasible directions in linear programming
• Introduction: New approaches to linear programming
• scientific article; zbMATH DE number 1047676 (Why is no real title available?)
• Computational behavior of a feasible direction method for linear programming
• The method of feasible directions for minimax problems
• An efficient search direction for linear programming problems
• All-integer column generation for set partitioning: basic principles and extensions
• A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
• scientific article; zbMATH DE number 4158377 (Why is no real title available?)
• scientific article; zbMATH DE number 3898608 (Why is no real title available?)
• A new efficient primal dual simplex algorithm
• scientific article; zbMATH DE number 4074826 (Why is no real title available?)

This page was built for publication: A feasible direction method for linear programming

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