Randomly generated polytopes for testing mathematical programming algorithms

W.B. van Dam*, J.B.G. Frenk, J. Telgen

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
5 Downloads (Pure)

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.

Original languageEnglish
Pages (from-to)172-181
Number of pages10
JournalMathematical programming
Volume26
Issue number2
DOIs
Publication statusPublished - 1 Jun 1983
Externally publishedYes

Keywords

  • Linear Inequalities
  • Random polytopes
  • Testing and comparing algorithms

Fingerprint

Dive into the research topics of 'Randomly generated polytopes for testing mathematical programming algorithms'. Together they form a unique fingerprint.

Cite this