We present the computation of the condition numbers for linear programming (LP) problems from the NETLIB suite. The method of Peña [Technical report, Center for Applied Mathematics, Cornell University, May 1998] was used to compute the bounds on the distance to ill-posedness ρ(d) of a given problem instance with data d, and the condition number was computed as C(d) = ‖d‖/ρ(d). We discuss the ef...

Development of hyperacute experimental allergic encephalomyelitis in Lewis rats after intraperitoneal administration of a mixture of guinea pig spinal cord emulsion and pertussigen from Bordetella pertussis was accompanied by an increase in vascular permeability in the central nervous system. The increased permeability was most striking in the spinal cord and seemed to be associated with the as...

A weak concept of compactness for nonmonotonic logics is proposed, which is suitable for several nonmonotonic logics, for which Makinsons smallest cumulative extension as well as Freund/Lehmanns canonical extension fail.

Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-complete. This hardness remains if P is restricted to be a standard cube and Q is restricted to be the affine image of a cross polytope. While this hardness classification by Freund and Orlin dates back to 1985, there seems to be only limited progress on that problem so far. Here, we study the H-...