A strictly improving linear programming Phase I algorithm

DOI10.1007/BF02023107zbMath0785.90068MaRDI QIDQ1312775

V. Pereyra

Publication date: 24 February 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

least-squaresdegeneracyquadratic programsPhase I algorithmstrict improvement

Mathematics Subject Classification ID

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

Related Items (6)

Mathematical programming via the least-squares method ⋮ ON SOLVING SHORTEST PATHS WITH A LEAST-SQUARES PRIMAL-DUAL ALGORITHM ⋮ A least-squares minimum-cost network flow algorithm ⋮ A primal deficient-basis simplex algorithm for linear programming ⋮ A strictly improving linear programming Phase I algorithm ⋮ A least-squares primal-dual algorithm for solving linear programming problems

Uses Software

• NETLIB LP Test Set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• The simplex method. A probabilistic analysis
• A new family of exponential LP problems
• A practical anti-cycling procedure for linearly constrained optimization
• A strictly improving linear programming Phase I algorithm
• Iterative refinement of linear least squares solutions I
• The Symmetric Formulation of the Simplex Method for Quadratic Programming

This page was built for publication: A strictly improving linear programming Phase I algorithm