Finding all solutions of piecewise-linear resistive circuits using separable programming

A new algorithm is proposed for finding all solutions of piecewise-linear resistive circuits using separable programming. In this algorithm, the problem of finding all solutions is formulated by a separable programming problem, and it is solved by the modified simplex method using the restricted-basis entry rule. Since the modified simplex method finds one solution per application, the proposed algorithm can find all solutions efficiently. Numerical examples are given to confirm the effectiveness of the proposed algorithm.