Abstract
A method of converting financial planning problems from mixed-integer to pure-integer programmes is demonstrated on three examples of progressively increasing complexity. The number of constraints and variables is thereby reduced, and the use of reliable integer programming algorithms on small computer systems is facilitated.