Show that Lagrangean duality reduces to linear programming duality when g(x) = Ax-b and S = {x | x ≥ 0}.
It suffices to show that the form of domination (3.38) used in the Lagrangean dual reduces to the form of domination used to define the linear programming dual.