Linear Programming - Covering-packing Dualities

A covering LP is a linear program of the form:

Minimize: bTy,

Subject to: ATy ≥ c, y ≥ 0,

such that the matrix A and the vectors b and c are non-negative.

The dual of a covering LP is a packing LP, a linear program of the form:

Maximize: cTx,

Subject to: Ax ≤ b, x ≥ 0,

such that the matrix A and the vectors b and c are non-negative.