The primal problem is to minimize $c^T x$ subject to the constraints $Ax \geq b$ and $x \geq 0$. Since all entries of $A, b$, and $c$ are positive, we can see that the feasible set for the primal problem is not empty. This is because we can always choose $x$ to be
Show more…