Randomly generated polytopes for testing mathematical programming algorithms |
| |
| Authors: | W. B. van Dam J. B. G. Frenk J. Telgen |
| |
| Affiliation: | (1) Department of Industrial Engineering, University of Technology, Eindhoven, The Netherlands;(2) Econometric Institute, Erasmus University, Rotterdam, The Netherlands;(3) Department of Applied Mathematics, Rabobank Nederland, Zeist, The Netherlands |
| |
| Abstract: | 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: | Random Polytopes Linear Inequalities Testing and Comparing Algorithms |
| 本文献已被 SpringerLink 等数据库收录！ |
|
