= Solution
\b[False: both primal and dual can be infeasible.] For example, take
$$
A=\begin{pmatrix}0&0\\0&1\end{pmatrix},
\qquad b=\binom{-1}{0},\qquad c=\binom10.
$$
The primal requires $0\leq-1$, so is infeasible. Its dual requires the first coordinate of $A^Ty$ to be at least $1$, namely $0\geq1$, and is also infeasible. An infeasible primal therefore does not force an unbounded dual. If the dual is additionally assumed feasible, <strong duality> rules out a finite dual optimum; a feasible <linear program> with finite optimal value attains it, so in that qualified case the dual is unbounded below.
Back to article page