I know how to solve a set of linear equalities with Gauss-Jordan elimination, but this gives me all real solutions. Is there a way to constrain all variables to the non-negative integers, i.e., $x \in \mathbb N$?
Use Gauss-Jordan elimination to solve a linear system for non-negative integer solutions?
1
$\begingroup$
linear-algebra
systems-of-equations
linear-programming
integer-programming
1 Answers
1
This is called integer programming. This is a huge complex field, with some of the common approaches being branch and bound and cutting plane methods. See the wiki links for more information.