 Home

Codex Wiki

Mathematics

Area of mathematics

Mathematical optimization

Linear programming

Linear programming duality

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.


Dual of a minimization linear program in inequality form

Past exam of the mathematics course of the University of Cambridge / 2024 / ib / Paper 1 / 7H / a / Solution

Dual of a minimization linear program in inequality form

 Ancestors (6)

 Incoming links (1)

 Discussion (0)

 Articles by others on the same topic (0)

Dual of a minimization linear program in inequality form

 Ancestors (6)

 Incoming links (1)

 Discussion (0)  Subscribe (1)

 Articles by others on the same topic (0)

 Discussion (0)