Finding all solutions of systems of nonlinear equations using the dual simplex method
From MaRDI portal
Publication:1599144
DOI10.1023/A:1021938622923zbMath0997.65080OpenAlexW85908331MaRDI QIDQ1599144
Kiyotaka Yamamura, Shigeru Tanaka
Publication date: 4 June 2002
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021938622923
algorithmlinear programmingnumerical examplesinterval analysisnonlinear equationsdual simplex method
Numerical mathematical programming methods (65K05) Numerical computation of solutions to systems of equations (65H10) Linear programming (90C05) Interval and finite arithmetic (65G30)
Related Items (9)
Finding all solutions of nonlinear equations using the dual simplex method ⋮ Application of the Krawczyk-Moore-Jones algorithm to electric circuit analysis and its further development ⋮ Existence test for solution of nonlinear systems applying affine arithmetic ⋮ Finding all solutions of separable systems of piecewise-linear equations using integer programming ⋮ An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test ⋮ Dynamics of competing ideas in complex social systems ⋮ An efficient algorithm for finding all solutions of separable systems of nonlinear equations ⋮ LP narrowing: A new strategy for finding all solutions of nonlinear equations ⋮ Finding all solution sets of piecewise-linear interval equations using an integer programming solver
This page was built for publication: Finding all solutions of systems of nonlinear equations using the dual simplex method
