Dual of an LP with Mixed Constraint Types

Extending the duality construction beyond standard form: how to write the dual of an LP whose primal has a mixture of \leq, \geq, and == constraints, and a mixture of 0\geq 0, 0\leq 0, and free variables, for both maximization and minimization primals.

Step 1 of 157%

Tutorial

Mixed Constraint Types in a Max Primal

In the standard-form max primal max cTx\max\ \mathbf{c}^T\mathbf{x} s.t. AxbA\mathbf{x}\leq \mathbf{b}, x0\mathbf{x}\geq 0, every primal constraint produces a nonnegative dual variable. When the primal has constraint types other than \leq, the sign restriction on the corresponding dual variable changes.

For a maximization primal

max cTxs.t.aiTx i bi, i=1,,m,x0,\max\ \mathbf{c}^T\mathbf{x}\quad \text{s.t.}\quad \mathbf{a}_i^T\mathbf{x}\ \square_i\ b_i,\ i=1,\dots,m,\quad \mathbf{x}\geq 0,

where each i{,,=}\square_i\in\{\leq,\geq,=\}, the dual is

min bTys.t.ATyc,\min\ \mathbf{b}^T\mathbf{y}\quad \text{s.t.}\quad A^T\mathbf{y}\geq \mathbf{c},

with the sign restriction on yiy_i determined by the type of the ii-th primal constraint:

Primal constraintDual variableaiTxbiyi0aiTxbiyi0aiTx=biyi free\begin{array}{c|c}\textbf{Primal constraint} & \textbf{Dual variable} \\ \hline \mathbf{a}_i^T\mathbf{x}\leq b_i & y_i\geq 0 \\ \mathbf{a}_i^T\mathbf{x}\geq b_i & y_i\leq 0 \\ \mathbf{a}_i^T\mathbf{x}= b_i & y_i\ \text{free} \end{array}

For instance, in a max primal, the constraint 2x1+x252x_1+x_2\geq 5 contributes 5yi5y_i to the dual objective and forces yi0y_i\leq 0. An equality constraint contributes a free dual variable.

navigate · Enter open · Esc close · ⌘K/Ctrl K toggle