In an earlier article Baumol and Gomory consider the problems created by the dual prices of an integer programming problem. They present a method for recomputing these dual prices so as to remedy some of these defects. This paper proposes an alternative view of the Baumol-Gomory recomputation process, which enables a reconciliation of the integer and linear programming properties. Moreover, we propose a further alteration of the Baumol-Gomory method that can be applied to cases in which nonzero prices are imputed to free goods in order to remove this property. We also show that even this method may not be entirely satisfactory in coping with the free goods problem.