 Dual of a minimization linear program in inequality form

ID: dual-of-a-minimization-linear-program-in-inequality-form

Codex  0 Created 2026-09-24 Updated 2026-09-24

The dual pair

min {c^{T} x : A x \geq b, x \geq 0} and max {b^{T} y : A^{T} y \leq c, y \geq 0}

satisfies weak duality because

b^{T} y \leq y^{T} A x = x^{T} A^{T} y \leq c^{T} x

for every feasible pair.

 New to topics? Read the docs here!