A computational study of redundancy in randomly generated polytopes
From MaRDI portal
Publication:1207047
DOI10.1007/BF02248692zbMath0766.90057MaRDI QIDQ1207047
H. A. Eiselt, Carl-Louis Sandblom
Publication date: 4 May 1993
Published in: Computing (Search for Journal in Brave)
Large-scale problems in mathematical programming (90C06) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Linear programming (90C05) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on detecting simple redundancies in linear systems
- Redundancy in mathematical programming. A state-of-the-art survey
- A feasible direction method for linear programming
- Experiments with external pivoting
- General criteria for redundant and nonredundant linear inequalities
- On the choice of the pivot columns of the simplex-method: Gradient criteria
- An analysis of an available set of linear programming test problems
- Computational behavior of a feasible direction method for linear programming
- The gravitational method for linear programming
- Randomly generated polytopes for testing mathematical programming algorithms
- Nonadjacent extreme point methods for solving linear programs
- The Efficiency of the Simplex Method: A Survey
- A practicable steepest-edge simplex algorithm
- Random polytopes: Their definition, generation and aggregate properties
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- The Probability that a Random Polytope is Bounded
- Empirical Studies on the Average Efficiency of Simplex Variants under Rotation Symmetry
- A comparison of the primal-simplex and primal-dual algorithms for linear programming
- A comparison of the primal‐simplex and complementary pivot methods for linear programming
