What is a Valid Inequality?

Defines a valid inequality for a set SS as one satisfied by every point of SS. Covers verifying validity by enumerating finite sets, enumerating integer points of an IP feasible region, and checking only the extreme points of conv(S)\mathrm{conv}(S).

Step 1 of 157%

Tutorial

Defining a Valid Inequality

Suppose we have a set SRnS \subseteq \mathbb{R}^n — for example, the set of feasible solutions to an integer program. We frequently want to characterize SS using linear inequalities.

An inequality πTxπ0\pi^T x \leq \pi_0, with coefficient vector πRn\pi \in \mathbb{R}^n and right-hand side π0R\pi_0 \in \mathbb{R}, is valid for SS if every point of SS satisfies it:

πTxπ0for all xS.\pi^T x \leq \pi_0 \quad \text{for all } x \in S.

Equivalently, the inequality is valid for SS if and only if

maxxSπTxπ0.\max_{x \in S} \pi^T x \leq \pi_0.

For example, take S={(1,0),(0,1),(2,1),(1,3)}S = \{(1,0),\, (0,1),\, (2,1),\, (1,3)\}. Is the inequality x1+x24x_1 + x_2 \leq 4 valid for SS? Evaluating x1+x2x_1 + x_2 at each point gives 1,1,3,41,\, 1,\, 3,\, 4. The maximum is 44, and 444 \leq 4, so the inequality is valid for SS.

If instead we asked about x1+x23x_1 + x_2 \leq 3, the point (1,3)(1,3) gives 1+3=4>31 + 3 = 4 > 3, so this second inequality would fail to be valid.

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