A basis-defiency-allowing variation of the simplex method for linear programming
From MaRDI portal
Publication:1806578
DOI10.1016/S0898-1221(98)00127-8zbMATH Open0941.90055MaRDI QIDQ1806578FDOQ1806578
Publication date: 8 November 1999
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Recommendations
linear programmingdegeneracyleast squares problemorthogonal transformationsimplex methodbasis deficiency
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New Finite Pivoting Rules for the Simplex Method
- A practical anti-cycling procedure for linearly constrained optimization
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- A practicable steepest-edge simplex algorithm
- Title not available (Why is that?)
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- Optimality and Degeneracy in Linear Programming
- Title not available (Why is that?)
- A dual approach to primal degeneracy
- Steepest-edge simplex algorithms for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical finite pivoting rules for the simplex method
- Programming of Interdependent Activities: II Mathematical Model
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- A Variant of the Dual Pivoting Rule in Linear Programming
- A dual projective simplex method for linear programming
- Title not available (Why is that?)
- A simplex-like method with bisection for linear programming1
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (25)
- An interesting characteristic of phase-1 of dual–primal algorithm for linear programming
- Sensitivity analysis of the optimal assignment.
- Combined projected gradient algorithm for linear programming
- Partial pricing rule simplex method with deficient basis
- A projective simplex algorithm using LU decomposition
- A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
- Book review of: P.-Q. Pan, Linear programming computation
- Efficient nested pricing in the simplex algorithm
- An affine-scaling pivot algorithm for linear programming
- A linear programming decomposition focusing on the span of the nondegenerate columns
- The positive edge criterion within COIN-OR's CLP
- A dual projective simplex method for linear programming
- A new version of the improved primal simplex for degenerate linear programs
- Title not available (Why is that?)
- A note on ``An improved initial basis for the simplex algorithm
- Phase I cycling under the most-obtuse-angle pivot rule
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Column generation decomposition with the degenerate constraints in the subproblem
- A phase-1 approach for the generalized simplex algorithm
- Row-reduced column generation for degenerate master problems
- Stabilized dynamic constraint aggregation for solving set partitioning problems
- A hybrid direction algorithm for solving linear programs
- Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
- A primal deficient-basis simplex algorithm for linear programming
Uses Software
This page was built for publication: A basis-defiency-allowing variation of the simplex method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806578)
