Randomly generated polytopes for testing mathematical programming algorithms
June 1983
Article
volume 26, issue 2 pp 172-181.
| Related Files |
|---|
View PDF Version
(Randomly_degenerated_polytopes.pdf, 0.4MB) |
|
Redirect to publisher's version
(publisher's version.url.txt, 36 bytes) |
Randomly generated polytopes are used frequently to test and compare algorithms for a variety of mathematical programming problems. These polytopes are constructed by generating linear inequality constraints with coefficients drawn independently from a distribution such as the uniform or the normal. It is noted that this class of 'random' polytopes has a special property: the angles between the hyperplanes, though dependent on the specific distribution used, tend to be equal when the dimension of the space increases. Obviously this structure of 'random' polytopes may bias test results.
Keywords
Automatically Extracted Terms
- polytope
- angle
- distribution
- algorithm
- van dam
- hyperplane
- uniform distribution
- programming
- probability
- uniform
- result
- section
- n c e
- inequality
- university
- al ./
- variable
- point
- method
- i.i.d
