AbstractA simplified form of an algorithm for solving mixed integer linear programmes is presented. It is introduced by considering the geometry of the problem, from which most of the terminology originates. The ideas developed are then translated into algebra. A simple logical flow diagram is presented and its use illustrated by a worked example. An appendix covers the more important refinements.