Duality inequalities as a numerical aid

This note re-examines the problem of estimating the minimum value of a convex program. To obtain a lower bound to this value a dual program is formulated. The dual involves only explicitly given functions and only inequality constraints. No nonlinear equality constraints appear. Thus a numerically feasible algorithm is obtained.