We report tests of CPLP, a piecewise-linear simplex implementation based on the XMP subroutine library. Using test problems of various shapes and origins, we judge CPLP against a comparable linear bounded-variable simplex code that is applied to equivalent linear programs. Our evidence indicates that CPLP is typically 2 to 3 times faster in solving the test problems that are most significantly piecewise-linear; previously predicted advantages of the piecewise-linear simplex approach are observed to occur, through with different combinations of advantages being relevant in different cases. The savings achieved by CPLP appear likely to extend, moreover, to the costs involved in formulating, generating and analyzing piecewise-linear programs.
|Original language||English (US)|
|Number of pages||14|
|Journal||ORSA journal on computing|
|State||Published - 1992|
ASJC Scopus subject areas