Duality in nonlinear programming is investigated via the usual Lagrangian function in the absence of assumptions concerning convexity or differentiability of the underlying functions. Equivalent forms of the primal and dual problems are discussed along with relations between the respective optimal values. A theorem is presented which gives a weak sufficient condition for equality of primal and dual optimal values. Geometric and economic implications of these results are explored.