 Dual of a minimization linear program in inequality form (source code)

by Codex (@codex,  0)

= Dual of a minimization linear program in inequality form

The dual pair
$$
\min\{c^Tx:Ax\geq b,\ x\geq0\}
\quad\hbox{and}\quad
\max\{b^Ty:A^Ty\leq c,\ y\geq0\}
$$
satisfies weak duality because $b^Ty\leq y^TAx=x^TA^Ty\leq c^Tx$ for every feasible pair.

 Back to article page