Randomly generated polytopes for testing mathematical programming algorithms

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

Waiting lists and disequilibrium modelling of the housing market in Poland 1955-1986

SIGLEAvailable from British Library Document Supply Centre- DSC:3597.7879(LU-DE-DP--98) / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Quantifying the Economic Effects of Non-Tariff Barriers: The Case of U.K. Footwear

No description supplie