The set of nonnegative solutions of a system of linear equations or inequalities is a convex polyhedron. If the coefficients of the system are chosen at random, the number of vertices of this polyhedron is a random variable. Its expected value, dependent on the probability distribution of the coefficients, which are assumed to be nonnegative throughout, is investigated, and a distribution-independent upper bound for this expected value is established. © 1987 Springer-Verlag New York Inc.
CITATION STYLE
Buchta, C. (1987). On nonnegative solutions of random systems of linear inequalities. Discrete & Computational Geometry, 2(1), 85–95. https://doi.org/10.1007/BF02187872
Mendeley helps you to discover research relevant for your work.