Binary Solutions for Overdetermined Systems of Linear Equations
arXiv:1101.30561.24 citationsh-index: 5
Originality Synthesis-oriented
AI Analysis
It provides a solution method for finding binary solutions to overdetermined linear systems, which is a specific problem in numerical linear algebra.
This paper presents a finite step method using dynamic programming and branch-and-bound to compute binary solutions for overdetermined linear systems, with numerical examples demonstrating its effectiveness.
This paper presents a finite step method for computing the binary solution to an overdetermined system of linear algebraic equations Ax = b, where A is an m x n real matrix of rank n < m, and b is a real m-vector. The method uses the optimal policy of dynamic programming along with the branch and bound concept. Numerical examples are given.