Publication | Closed Access
New Finite Pivoting Rules for the Simplex Method
445
Citations
0
References
1977
Year
Numerical AnalysisMathematical ProgrammingComputational Complexity TheoryEngineeringNumerical ComputationValidated NumericsAlgorithm DesignPivoting RuleAlgebraic MethodComputational ComplexitySimple ProofSimplex MethodComputer ScienceDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationApproximation Theory
A simple proof of finiteness is given for the simplex method under an easily described pivoting rule. A second new finite version of the simplex method is also presented.