In this paper, we present the implementation of a parallel road traffic simulation using the concept of Lane Cut Points (LCPs) in the Spider programming environment. LCPs are storage buffers inserted into lane data structures at the road network partition edges. Vehicles enter a partition at the edges from an LCP and exit a partition edge into an LCP at the end of every simulation step. Spider,...

Techniques for transforming convex quadratic programs (QPs) into monotone linear complementarity problems (LCPs) and vice versa are well known. We describe a class of LCPs for which a reduced QP formulation|one that has fewer constraints than the \stan-dard" QP formulation|is available. We mention several instances of this class, including the known case in which the coeecient matrix in the LCP...

This paper presents a connection between qualitative matrix theory and linear complementarity problems (LCPs). An LCP is said to be sign-solvable if the set of the sign patterns of the solutions is uniquely determined by the sign patterns of the given coefficients. We provide a characterization for sign-solvable LCPs such that the coefficient matrix has nonzero diagonals, which can be tested in...

Techniques for transforming convex quadratic programs (QPs) into monotone linear complementarity problems (LCPs) and vice versa are well known. We describe a class of LCPs for which a reduced QP formulation|one that has fewer constraints than the \standard" QP formulation|is available. We mention several instances of this class, including the known case in which the coe cient matrix in the LCP ...

Techniques for transforming convex quadratic programs (QPs) into monotone linear complementarity problems (LCPs) and vice versa are well known. We describe a class of LCPs for which a reduced QP formulation|one that has fewer constraints than the \stan-dard" QP formulation|is available. We mention several instances of this class, including the known case in which the coeecient matrix in the LCP...

General Successive Convex Relaxation Methods (SRCMs) can be used to compute the convex hull of any compact set, in an Euclidean space, described by a system of quadratic inequalities and a compact convex set. Linear Complementarity Problems (LCPs) make an interesting and rich class of structured nonconvex optimization problems. In this paper, we study a few of the specialized lift-and-project m...

We and others have demonstrated that provision of n-3 long chain polyunsaturated fatty acids (n-3 LCPs) in preterm and term babies is associated with retinal electrical responses to light stimuli, and to brain cortex related visual acuity maturation, that are similar to those observed in human milk fed infants. Our follow up results in young children suggest that neurodevelopment and cognitive ...

The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity, average-reward, and discounted games. The algorithms have not been previously studied in the context of infinite games, and they offer alternatives to the classical strategy-improvement algorithms. The two algorithm...

In this paper we describe a computational study of block principal pivoting (BP) and interior-point predictor-corrector (PC) algorithms for the solution of large-scale linear complementarity problems (LCP) with symmetric positive definite matrices. This study shows that these algorithms are in general quite appropriate for this type of LCPs. The BP algorithm does not seem to be sensitive to bad...

A comparative experimental study of shear-flow rheological properties of thermotropic polymer liquid crystals by eight different laboratories is described. The materials involved four different liquid-crystalline polyesters (LCPs), a glassfiber-filled liquid-crystalline polyester, hydroxypropyl cellulose (HPC), and two non-liquid-crystalline high-temperature polymers, a poly(etheretherketone) (...