Randomly generated polytopes for testing mathematical programming algorithms

DOI10.1007/BF02592053zbMath0516.90063OpenAlexW2123065190MaRDI QIDQ3664841

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

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592053

zbMATH Keywords

linear inequalitiesrandomly generated polytopestesting and comparing algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Mathematical programming (90C99) Numerical methods in optimal control (49M99) Polytopes and polyhedra (52Bxx)

Related Items (3)

An optimal-basis identification technique for interior-point linear programming algorithms ⋮ A computational study of redundancy in randomly generated polytopes ⋮ Random polytopes: Their definition, generation and aggregate properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• Random polytopes: Their definition, generation and aggregate properties
• The Probability that a Random Polytope is Bounded
• Geometrical Probability and Random Points on a Hypersphere
• Some Empirical Tests of the Criss-Cross Method
• Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: Randomly generated polytopes for testing mathematical programming algorithms