A practicable steepest-edge simplex algorithm
From MaRDI portal
Publication:3887219
Cites work
- A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- A stabilization of the simplex method
- scientific article; zbMATH DE number 3612766 (Why is no real title available?)
- scientific article; zbMATH DE number 3206575 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3354790 (Why is no real title available?)
- On the Bartels—Golub decomposition for linear programming bases
- Pivot selection methods of the Devex LP code
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
Cited in
(52)- An overview on the simplex algorithm
- A Z-simplex algorithm with partial updates
- On the choice of the pivot columns of the simplex-method: Gradient criteria
- A relaxed version of Karmarkar's method
- The simplex method is not always well behaved
- Worst case behavior of the steepest edge simplex method
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- A computational study of redundancy in randomly generated polytopes
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- MOPS -- Mathematical optimization system
- Adjacent vertex simplex algorithms: More experimental results on random problems
- A linear programming approach to reasoning about probabilities
- Advances in design and implementation of optimization software
- Customizing the solution process of COIN-OR's linear solvers with python
- Steepest-edge simplex algorithms for linear programming
- A basis-defiency-allowing variation of the simplex method for linear programming
- A dual strategy for solving the linear programming relaxation of a driver scheduling system
- Solving linear programs with multiple right-hand sides: Pricing and ordering schemes
- Empirical column selection method in the simplex method
- A projective simplex algorithm using LU decomposition
- Computing in combinatorial optimization
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
- A largest-distance pivot rule for the simplex algorithm
- Systematic construction of examples for cycling in the simplex method
- Upper bound limit analysis using discontinuous velocity fields
- Improved primal simplex: a more general theoretical framework and an extended experimental analysis
- A pivoting algorithm for linear programming with linear complementarity constraints
- A linear programming decomposition focusing on the span of the nondegenerate columns
- Algebraic simplex initialization combined with the nonfeasible basis method
- The positive edge criterion within COIN-OR's CLP
- On scaling linear programs—some experimental results
- A degeneracy exploiting LU factorization for the simplex method
- On the Bartels—Golub decomposition for linear programming bases
- Solving staircase linear programs by the simplex method, 2: Pricing
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- New crash procedures for large systems of linear constraints
- Primal-dual methods for sustainable harvest scheduling problems
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method
- Optimal pivot path of the simplex method for linear programming based on reinforcement learning
- A steepest feasible direction method for linear programming. Derivation and embedding in the simplex method
- A global pricing extension of the simplex method
- On the equivalence of the simplex methods and a multiplier-alike method for linear programming
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- Practical finite pivoting rules for the simplex method
- A new LAD curve-fitting algorithm: Slightly overdetermined equation systems in \(L_ 1\)
- Efficient GPU-based implementations of simplex type algorithms
- Canonical bases in linear programming
- A ``build-down scheme for linear programming
- Efficient nested pricing in the simplex algorithm
- A computational approach to pivot selection in the LP relaxation of set problems
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Towards a practical parallelisation of the simplex method
This page was built for publication: A practicable steepest-edge simplex algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887219)
