Randomly generated polytopes for testing mathematical programming algorithms

DOI10.1007/BF02592053MaRDI QIDQ3664841zbMATH OpenOpenAlexFDO

Authors W. B. van Dam, J. B. G. Frenk, 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 methods in optimal control (49M99) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Polytopes and polyhedra (52Bxx) Numerical mathematical programming methods (65K05) Mathematical programming (90C99)

Cites work

• Geometrical Probability and Random Points on a Hypersphere
• scientific article; zbMATH DE number 3136275 (Why is no real title available?)
• scientific article; zbMATH DE number 3626518 (Why is no real title available?)
• scientific article; zbMATH DE number 3638844 (Why is no real title available?)
• Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs
• OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations
• Random polytopes: Their definition, generation and aggregate properties
• Redundancy in mathematical programming. A state-of-the-art survey
• Some Empirical Tests of the Criss-Cross Method
• The Probability that a Random Polytope is Bounded
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664841)