About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Complexity
Paper
A linear programming instance with many crossover events
Abstract
Crossover events for a linear programming problem were introduced by Vavasis and Ye and provide important insight into the behavior of the path of centers. The complexity of a layered-step interior-point algorithm presented by them depends on the number of disjoint crossover events and the coefficient matrix A, but not on b and c. In this short note, we present a linear programming instance with more than n2/8 disjoint crossover events. © 1996 Academic Press, Inc.