An interior feasible direction method with constraint projections for linear programming

DOI10.1016/0898-1221(90)90163-EzbMath0727.90048MaRDI QIDQ804468

N. E. Zubov

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

parallel computinggradient projectionnon-simplex feasible direction method

Mathematics Subject Classification ID

Linear programming (90C05) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A feasible descent cone method for linearly constrained minimization problems

Uses Software

• IMSL Numerical Libraries

Cites Work

• A new polynomial-time algorithm for linear programming
• An external reconstruction approach (ERA) to linear programming
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Convex Simplex Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item