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 signiicantly p...

Recently Braga and Mello conjectured that for a given n ∈ N there is a piecewise linear system with two zones in the plane with exactly n limit cycles. In this paper we prove a result from which the conjecture is an immediate consequence. Several explicit examples are given where location and stability of limit cycles are provided.

We study the l1-error of a Hamiltonian-preserving scheme, developed in [11], for the Liouville equation with a piecewise constant potential in one space dimension. This problem has important applications in computations of the semiclassical limit of the linear Schrödinger equation through barriers, and of the high frequency waves through interfaces. We use the l1-error estimates established in ...

We study the l1-error of a Hamiltonian-preserving scheme, developed in [11], to the Liouville equation with a piecewise constant potential in one space dimension. This problem has important applications in computations of the semiclassical limit of the linear Schrödinger equation through barriers, and of the high frequency waves through interfaces. We use the l1-error estimates established in [...

Generalizations of the well-known simplex method for linear programming are available to solve the piecewise linear programming problem and the linear fractional programming problem. In this paper we consider a further generalization of the simplex method to solve piecewise linear fractional programming problems unifying the simplex method for linear programs, piecewise linear programs, and the...