scientific article; zbMATH DE number 3614492

MaRDI QIDQ4178772zbMATH OpenFDO

Authors P. M. Harris

Publication date 1975

zbMATH Keywords

Simplex AlgorithmComputational EfficiencyLinear ProgrammingPivot Selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Cited in

(14)

• A phase-1 approach for the generalized simplex algorithm
• A computational approach to pivot selection in the LP relaxation of set problems
• A dual approach to primal degeneracy
• A primal deficient-basis simplex algorithm for linear programming
• Customizing the solution process of COIN-OR's linear solvers with python
• Numerical behavior of LP algorithms based upon the decomposition principle
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• On the solution of highly degenerate linear programmes
• Nonadjacent extreme point methods for solving linear programs
• A basis-defiency-allowing variation of the simplex method for linear programming
• An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
• Improving a primal–dual simplex-type algorithm using interior point methods
• The positive edge criterion within COIN-OR's CLP
• Complexity of the gravitational method for linear programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178772)