Duality in linear programming refers to the principle that every linear programming problem (the 'primal') has an associated dual problem, where the solution to one provides insights into the solution of the other. This relationship is fundamental in optimization as it allows for the verification of optimality and provides bounds on the objective function value of the primal problem.