NON-LINEAR INTEGER PROGRAMMING FOR VARIOUS FORMS OF CONSTRAINTS

A theoretical and computational investigation is made of the performance of a dynamic-programming-based algorithm for nonlinear integer problems with various types of constraints. Included are linear constraints, aggregated linear constraints, separable nonlinear constraints and constraints involving maxima and minima. Separability of the objective function is assumed. The new feature of the algorithm is that two type fathoming or pruning are used to reduce the size of tables and number of computations: fathoming by bounds and fathoming by infeasibility.