A strictly improving linear programming Phase I algorithm
From MaRDI portal
Recommendations
- An improved general Phase-I method in linear programming
- An Improved Successive Linear Programming Algorithm
- A general phase-I method in linear programming
- scientific article; zbMATH DE number 4066615
- An improved algorithm of simplex method in linear programming problem
- Improved deterministic algorithms for linear programming in low dimensions
- Improved deterministic algorithms for linear programming in low dimensions
- An algorithm for solving a structured class of linear programming problems
- A combined phase I-phase II projective algorithm for linear programming
- A better first step for Khachlan's algorithm in linear programming
Cites work
- A new family of exponential LP problems
- A numerically stable dual method for solving strictly convex quadratic programs
- A practical anti-cycling procedure for linearly constrained optimization
- A strictly improving linear programming Phase I algorithm
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- Iterative refinement of linear least squares solutions I
- The simplex method. A probabilistic analysis
- The Symmetric Formulation of the Simplex Method for Quadratic Programming
Cited in
(14)- A general phase-I method in linear programming
- An improved general Phase-I method in linear programming
- A strictly improving linear programming Phase I algorithm
- A piecewise linear dual phase-1 algorithm for the simplex method
- A least-squares primal-dual algorithm for solving linear programming problems
- A primal deficient-basis simplex algorithm for linear programming
- ON SOLVING SHORTEST PATHS WITH A LEAST-SQUARES PRIMAL-DUAL ALGORITHM
- An improved targeted climbing algorithm for linear programs
- A new revised simplex method for degenerate linear programs
- A phase-I algorithm based on the basis deficiency perturbation primal simplex method
- Direct phasing by binary integer programming
- Mathematical programming via the least-squares method
- A least-squares minimum-cost network flow algorithm
- An update-and-stabilize framework for the minimum-norm-point problem
This page was built for publication: A strictly improving linear programming Phase I algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312775)