I was trying to solve problem from Cormen page 1100 34.5-2
Given an integer $m * n$ matrix A and an integer $m$-vector $b$, the 0-1 integer- programming problem asks whether there exists an integer $n$-vector $x$ with elements in the set $<0, 1>$ such that $Ax\leq b$. Prove that 0-1 integer programming is NP-complete. (Hint: Reduce from 3-CNF-SAT.)
I do not understand what is 0-1 integer programming problem and what m and n vector mean here... Like what $Ax\leq b$ means.
Here is solution (I will really appreciate if you can explain me this one..):