Randomly generated polytopes for testing mathematical programming algorithms

W.B. van Dam; J.B.G. Frenk; J. Telgen

doi:10.1007/BF02592053

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 journal › Article › Academic › peer-review

4 Citations (Scopus)

17 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 language	English
Pages (from-to)	172-181
Number of pages	10
Journal	Mathematical programming
Volume	26
Issue number	2
DOIs	https://doi.org/10.1007/BF02592053
Publication status	Published - 1 Jun 1983
Externally published	Yes

Keywords

Linear Inequalities
Random polytopes
Testing and comparing algorithms

Access to Document

10.1007/BF02592053

VanDam1983randomlyFinal published version, 372 KB

Cite this

@article{a1d9c355c743430b826fea29d6ae27ca,

title = "Randomly generated polytopes for testing mathematical programming algorithms",

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 = "Linear Inequalities, Random polytopes, Testing and comparing algorithms",

author = "{van Dam}, W.B. and J.B.G. Frenk and J. Telgen",

year = "1983",

month = jun,

day = "1",

doi = "10.1007/BF02592053",

language = "English",

volume = "26",

pages = "172--181",

journal = "Mathematical programming",

issn = "0025-5610",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - Randomly generated polytopes for testing mathematical programming algorithms

AU - van Dam, W.B.

AU - Frenk, J.B.G.

AU - Telgen, J.

PY - 1983/6/1

Y1 - 1983/6/1

N2 - 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.

AB - 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.

KW - Linear Inequalities

KW - Random polytopes

KW - Testing and comparing algorithms

UR - http://www.scopus.com/inward/record.url?scp=0020764913&partnerID=8YFLogxK

U2 - 10.1007/BF02592053

DO - 10.1007/BF02592053

M3 - Article

AN - SCOPUS:0020764913

SN - 0025-5610

VL - 26

SP - 172

EP - 181

JO - Mathematical programming

JF - Mathematical programming

IS - 2

ER -

Randomly generated polytopes for testing mathematical programming algorithms

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this