Skip to content

Nonnegativity Constraint

Definition

A nonnegativity constraint requires a decision variable to satisfy xj≥0x_j\ge0. It excludes negative quantities while permitting zero. For a vector of variables, x≥0\boldsymbol{x}\ge0 means xj≥0x_j\ge0 for every component jj. In the course's augmented simplex models, all original and auxiliary variables are nonnegative.


Interpretation

A nonnegativity constraint says that a variable cannot go below zero. Produced or shipped amounts are naturally of this kind, but the model only knows it once xj≥0x_j\ge0 is written down.

The first quadrant shaded, with the region below the line 2x1 + 2.4x2 = 7.2 marked as feasible. The coordinate axes are the nonnegativity constraints; points with a negative coordinate are excluded.

The two axes are the boundaries of x1≥0x_1\ge0 and x2≥0x_2\ge0, which together keep the first quadrant. The line 2x1+2.4x2=7.22x_1+2.4x_2=7.2, meeting the axes at (3.6,0)(3.6,0) and (0,3)(0,3), cuts off the darker triangle of feasible points; everything with a negative coordinate is excluded.

Zero is allowed: corners of a feasible region often lie on an axis, such as (0,80)(0,80) in the Giapetto region. The constraints matter even when they look harmless: without them, maximizing x1x_1 over the half-plane 2x1+2.4x2≤7.22x_1+2.4x_2\le7.2 would have no optimum, since x2x_2 could be made as negative as wanted. A variable that can be a profit or a loss takes either sign; it is left unrestricted or handled by a transformation. A common slip is to read xj≥0x_j\ge0 as xj>0x_j>0, or as "xjx_j is a whole number"; it means neither.


Key Results

  • Nonnegativity is a constraint, not an automatic consequence of a variable name.
  • With two nonnegative variables, feasible points lie in the first quadrant.
  • Nonnegative continuous variables may still take fractional values.
  • At an optimum a nonnegativity constraint is either slack (xj∗>0x_j^\ast>0) or binding (xj∗=0x_j^\ast=0); in nonlinear problems this is what the Kuhn-Tucker conditions with nonnegativity constraints handle.

Examples

  • xs≥0x_s\ge0 prevents negative soldier production.
  • s1≥0s_1\ge0 ensures that a slack variable represents unused rather than exceeded capacity.

Prerequisites

Sources

Aliases: non-negativity constraint, sign restriction, nonnegativity restriction, sign constraint

Last updated: 27 October 2026 11:52