A linear programming decomposition focusing on the span of the nondegenerate columns
From MaRDI portal
Publication:319585
DOI10.1016/j.ejor.2015.03.019zbMath1346.90577OpenAlexW2085717333MaRDI QIDQ319585
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.03.019
Related Items
The positive edge pricing rule for the dual simplex, Dynamic constraint and variable aggregation in column generation
Uses Software
Cites Work
- The positive edge criterion within COIN-OR's CLP
- A new version of the improved primal simplex for degenerate linear programs
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- A practical anti-cycling procedure for linearly constrained optimization
- Selected bibliography on degeneracy
- A phase-1 approach for the generalized simplex algorithm
- A basis-defiency-allowing variation of the simplex method for linear programming
- A primal deficient-basis simplex algorithm for linear programming
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis
- An Improved Primal Simplex Algorithm for Degenerate Linear Programs
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
- A degeneracy exploiting LU factorization for the simplex method
- A practicable steepest-edge simplex algorithm
- Large-scale linearly constrained optimization
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- New Finite Pivoting Rules for the Simplex Method
- A Revised Dual Projective Pivot Algorithm for Linear Programming
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation
- Pivot selection methods of the Devex LP code
- Optimality and Degeneracy in Linear Programming
