Finding all solutions of separable systems of piecewise-linear equations using integer programming

DOI10.1016/J.CAM.2012.01.021MaRDI QIDQ413729zbMATH OpenOpenAlexFDO

Authors Kiyotaka Yamamura, Naoya Tamura

Publication date 7 May 2012

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2012.01.021

zbMATH Keywords

algorithmsinteger programmingfinding all solutionspiecewise-linear equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• Finding all solution sets of piecewise-linear interval equations using an integer programming solver
• scientific article; zbMATH DE number 5811179
• Finding multiple solutions to general integer linear programs
• An efficient algorithm for finding all solutions of separable systems of nonlinear equations
• scientific article; zbMATH DE number 1131737
• scientific article; zbMATH DE number 4037605
• Checking solvability of systems of interval linear equations and inequalities via mixed integer programming
• Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
• The solution of linear interval equations by a linear programming method
• scientific article; zbMATH DE number 1543280

Cites work

• scientific article; zbMATH DE number 1595639 (Why is no real title available?)
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
• A new exclusion test.
• Algorithm 852
• An efficient algorithm for finding all solutions of separable systems of nonlinear equations
• Applications of interval computations. Proceedings of an international workshop, El Paso, TX, USA, February 23-25, 1995
• Approximating separable nonlinear functions via mixed zero-one programs
• Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
• Explicit formulas for the solutions of piecewise linear networks
• Finding all solutions of nonlinear equations using linear combinations of functions
• Finding all solutions of nonlinear equations using the dual simplex method
• Finding all solutions of piecewise-linear circuits
• Finding all solutions of piecewise-linear resistive circuits using the simplex method
• Finding all solutions of systems of nonlinear equations using the dual simplex method
• Interval solution of nonlinear equations using linear programming
• LP narrowing: A new strategy for finding all solutions of nonlinear equations
• Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
• On bounding solutions of underdetermined systems
• SCIP: solving constraint integer programs
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations

Cited in

(4)

• Finding all solution sets of piecewise-trapezoidal equations described by set-valued functions
• An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test
• Finding all solution sets of piecewise-linear interval equations using an integer programming solver
• scientific article; zbMATH DE number 5811179 (Why is no real title available?)

Describes a project that uses

Uses Software

• SCIP
• CPLEX
• Gurobi
• RealPaver
• GLPK

This page was built for publication: Finding all solutions of separable systems of piecewise-linear equations using integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413729)