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

Argumentation in Foreign Policy Settings

This is a study of argumentation in three different kinds of high level, confidential, foreign policy settings: a collegial setting, a bureaucratic setting, and a bargaining setting. The causal and value assertions of the participants were coded using the detailed records of these three settings. The data show to be inadequate a defense/ attack model of argumentation in which the participants support their own arguments to make them resistant to attack, while attacking the weak spots in others'stated positions. In fact, there are few assertions which are supported by specific evidence, almost no mutually supported causal arguments, and the assertions which were attacked were no less emphasized than the assertions which were not attacked. More in accord with the data is the novel-arguments approach in which the key factor in persuasive argumentation is the development of arguments which others have not already taken into account.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/67391/2/10.1177_002200277702100410.pd