Recovering an optimal LP basis from an interior point solution
From MaRDI portal
Recommendations
- On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
- An optimal-basis identification technique for interior-point linear programming algorithms
- On Finding Primal- and Dual-Optimal Bases
- Implementation of an interior point method with basis preconditioning
- Recovering an optimal LP basis from an optimal dual solution
Cites work
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 194432 (Why is no real title available?)
- Computational experience with a primal-dual interior point method for linear programming
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Convergence behavior of interior-point algorithms
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- Implementing the Simplex Method: The Initial Basis
- Modification of the minimum-degree algorithm by multiple elimination
- Numerical Factorization Methods for Interior Point Algorithms
- On Finding Primal- and Dual-Optimal Bases
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On finding a vertex solution using interior point methods
- Pivot selection methods of the Devex LP code
- The Composite Simplex Algorithm
Cited in
(17)- Converging upon basic feasible solutions through Dantzig-Wolfe decomposition
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- On the uniqueness of optimal strategies in symmetric matrix games
- Implementation of an interior point method with basis preconditioning
- Degeneracy in interior point methods for linear programming: A survey
- Could we use a million cores to solve an integer program?
- On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers
- Recovering an optimal LP basis from an optimal dual solution
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- POSITIVE SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING
- Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
- Improving a primal–dual simplex-type algorithm using interior point methods
- LPAKO: A Simplex-based Linear Programming Program
- Modified fictitious play for solving matrix games and linear-programming problems
- Towards an efficient augmented Lagrangian method for convex quadratic programming
- ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING
This page was built for publication: Recovering an optimal LP basis from an interior point solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342078)
