An improved algorithm for non-linear integer programming

AbstractAn exact method for solving all-integer non-linear programming problems with a separable non-decreasing objective function is presented. Dynamic programming methodology is used to search candidate hypersurfaces for the optimal feasible integer solution. Computational efficiency is improved by eliminating candidate hypersurfaces on which no integer solutions exist and by discarding partial solutions which are infeasible at an early stage