This research announcement introduces an algorithm for obtaining integer solutions to linear programs, a problem that arises in various contexts, including combinatorial optimization and economic scaling. The algorithm, outlined by Ralph E. Gomory, has been programmed and successfully applied to small linear programs (with seven or fewer variables). The method involves maximizing the objective function using the simplex method, then adding new constraints to force the solution to be integer-valued. These constraints are systematically generated to ensure the process is finite and effective. The paper also discusses the systematic generation of these constraints and provides a proof of the algorithm's finiteness, which will be presented separately. The algorithm is designed to be automated and has been tested on an E101 computer.This research announcement introduces an algorithm for obtaining integer solutions to linear programs, a problem that arises in various contexts, including combinatorial optimization and economic scaling. The algorithm, outlined by Ralph E. Gomory, has been programmed and successfully applied to small linear programs (with seven or fewer variables). The method involves maximizing the objective function using the simplex method, then adding new constraints to force the solution to be integer-valued. These constraints are systematically generated to ensure the process is finite and effective. The paper also discusses the systematic generation of these constraints and provides a proof of the algorithm's finiteness, which will be presented separately. The algorithm is designed to be automated and has been tested on an E101 computer.