A formulation and some properties of the (Lagrangian) dual of the dual of a mathematical programming problem were presented in an article by Unger and Hurter (1972). Here, that formulation is simplified, so that the resulting form is more closely related to the primal. In particular, the dual of the dual is shown to be merely the primal, except that the objective function and each constraint are replaced by their first-order Taylor series approximation.