Binary solutions for overdetermined systems of linear equations

MaRDI QIDQ2793068zbMATH OpenFDO

Authors Subhendu Das

Publication date 14 March 2016

Published in Advanced Modeling and Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1101.3056, http://camo.ici.ro/journal/vol14/v14a21.pdf

zbMATH Keywords

Boolean programmingbranch and bound methoddynamic programminglinear equationsnumerical methodsoverdetermined systems

Mathematics Subject Classification ID

Integer programming (90C10)

Abstract: 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.

Recommendations

• scientific article; zbMATH DE number 37926
• Using least square method to find the approximate solution of an overdetermined system of linear equations
• Overdetermined Systems of Linear Equations
• An algorithm for non-negative norm minimal solutions
• An algorithm for binary linear programming

Cited in

(4)

• Binary vectors partially determined by linear equation systems
• Solving Binary Linear Equation Systems over the Rationals and Binaries
• Binary solutions to large systems of linear equations
• On the complexity of solving generic overdetermined bilinear systems

This page was built for publication: Binary solutions for overdetermined systems of linear equations

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