Constructing integer programming models by the predicate calculus

A modelling language for Integer Programming (IP) based on the Predicate Calculus is described. This is particularly suitable for building models with logical conditions. Using this language a model is specified in terms of predicates. This is then converted automatically by a series of transformation rules into a normal form from which an IP model can be created. There is also some discussion of alternative IP formulations which can be incorporated into the system as options. Further practical considerations are discussed briefly concerning implementation language and incorporation into practical Mathematical Programming Systems