An interior feasible direction method with constraint projections for linear programming

DOI10.1016/0898-1221(90)90163-EzbMATH Open0727.90048MaRDI QIDQ804468FDOQ804468

Authors 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

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

Recommendations

• A feasible direction method for linear programming
• The complex interior-boundary method for linear and nonlinear programming with linear constraints
• Search directions for a class of projective methods
• An experimental investigation of a new multiplex method for linear programming
• scientific article; zbMATH DE number 4189470

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 4002053 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• scientific article; zbMATH DE number 3626518 (Why is no real title available?)
• scientific article; zbMATH DE number 3284927 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• An external reconstruction approach (ERA) to linear programming
• The Convex Simplex Method
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

Cited in

(8)

• scientific article; zbMATH DE number 3852784 (Why is no real title available?)
• A steepest feasible direction extension of the simplex method
• Search directions for a class of projective methods
• Linear programming with a feasible direction interior point technique for smooth optimization
• A feasible descent cone method for linearly constrained minimization problems
• A feasible direction method for linear programming
• The complex interior-boundary method for linear and nonlinear programming with linear constraints
• An experimental investigation of a new multiplex method for linear programming

Describes a project that uses

Uses Software

• IMSL Numerical Libraries

This page was built for publication: An interior feasible direction method with constraint projections for linear programming

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