A practicable steepest-edge simplex algorithm
From MaRDI portal
Publication:3887219
DOI10.1007/BF01593804zbMath0443.90058OpenAlexW2011959190MaRDI QIDQ3887219
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593804
Related Items (49)
A pivoting algorithm for linear programming with linear complementarity constraints ⋮ A Z-simplex algorithm with partial updates ⋮ On the choice of the pivot columns of the simplex-method: Gradient criteria ⋮ A linear programming decomposition focusing on the span of the nondegenerate columns ⋮ Algebraic simplex initialization combined with the nonfeasible basis method ⋮ A linear programming approach to reasoning about probabilities ⋮ A dual strategy for solving the linear programming relaxation of a driver scheduling system ⋮ A relaxed version of Karmarkar's method ⋮ The positive edge criterion within COIN-OR's CLP ⋮ The simplex method is not always well behaved ⋮ Solving linear programs with multiple right-hand sides: Pricing and ordering schemes ⋮ Empirical column selection method in the simplex method ⋮ Worst case behavior of the steepest edge simplex method ⋮ Customizing the solution process of COIN-OR's linear solvers with python ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method ⋮ Canonical bases in linear programming ⋮ A ``build-down scheme for linear programming ⋮ A projective simplex algorithm using LU decomposition ⋮ A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications ⋮ A largest-distance pivot rule for the simplex algorithm ⋮ Efficient nested pricing in the simplex algorithm ⋮ A computational approach to pivot selection in the LP relaxation of set problems ⋮ On scaling linear programs—some experimental results ⋮ Multi-phase dynamic constraint aggregation for set partitioning type problems ⋮ A computational study of redundancy in randomly generated polytopes ⋮ Towards a practical parallelisation of the simplex method ⋮ On the equivalence of the simplex methods and a multiplier-alike method for linear programming ⋮ Systematic construction of examples for cycling in the simplex method ⋮ Primal-dual methods for sustainable harvest scheduling problems ⋮ New crash procedures for large systems of linear constraints ⋮ On the Bartels—Golub decomposition for linear programming bases ⋮ Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis ⋮ A degeneracy exploiting LU factorization for the simplex method ⋮ Steepest-edge rule and its number of simplex iterations for a nondegenerate LP ⋮ Steepest-edge simplex algorithms for linear programming ⋮ A basis-defiency-allowing variation of the simplex 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 ⋮ An overview on the simplex algorithm ⋮ The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study ⋮ Computing in combinatorial optimization ⋮ Upper bound limit analysis using discontinuous velocity fields ⋮ Solving staircase linear programs by the simplex method, 2: Pricing ⋮ A new LAD curve-fitting algorithm: Slightly overdetermined equation systems in \(L_ 1\) ⋮ Advances in design and implementation of optimization software ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis ⋮ MOPS -- Mathematical optimization system ⋮ Adjacent vertex simplex algorithms: More experimental results on random problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stabilization of the simplex method
- 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
- On the Bartels—Golub decomposition for linear programming bases
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Pivot selection methods of the Devex LP code
This page was built for publication: A practicable steepest-edge simplex algorithm
