scientific article; zbMATH DE number 4213737

MaRDI QIDQ3360663zbMATH OpenFDO

Authors M. M. Lychak

Publication date 1990

zbMATH Keywords

clipping method

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 4093173
• Iterative method for the solution and decomposition of linear programming problems
• An iterative algorithm of nonlinear mathematical programming problem
• Iterative linear programming solution of convex programs
• Iterative refinement for linear programming
• Iterative method for solving the linear feasibility problem
• scientific article; zbMATH DE number 4102817
• Iterative algorithms for the linear complementarity problem
• A fast converging iterative algorithm for linear programming
• An efficient algorithm for linear programming

Cited in

(8)

• Iterative linear programming solution of convex programs
• Modification of the recursive solution procedure for a linear programming problem
• scientific article; zbMATH DE number 1135779 (Why is no real title available?)
• scientific article; zbMATH DE number 7339111 (Why is no real title available?)
• Method for sequential activation of limitations in linear programming
• scientific article; zbMATH DE number 5018767 (Why is no real title available?)
• A fast converging iterative algorithm for linear programming
• On the topological Picard's fixed point iterative algorithm for the simplex method of optimization

This page was built for publication:

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