This paper develops a simple, dual-based, and monotonic bounding procedure for solving integer linear programs. Although it is dual-based, it can be usefully applied for integer programs for which the LP relaxation yields good bounds but cannot be solved easily by direct methods. Preliminary results of the application of the procedure on a class of real-world problems are promising