Note that we assume in our calculations steps that the program is in standard form. However, any linear program may be transformed to standard form and it is therefore not a limiting factor.
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