The generalized linear programming algorithm allows an arbitrary mathematical programming minimization problem to be analyzed as a sequence of linear programming approximations. Under fairly general assumptions, it is demonstrated that any limit point of the sequence of optimal linear programming dual prices produced by the algorithm is optimal in a concave maximization problem that is dual to the arbitrary primal problem. This result holds even if the generalized linear programming problem does not solve the primal problem. The result is a consequence of the equivalence that exists between the operations of convexification and dualization of a primal problem. The exact mathematical nature of this equivalence is given.