Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming

Abstract

This paper suggests a method of formulating any nonlinear integer programming problem, with any number of constraints, as an equivalent single constraint problem, thus reducing the dimensionality of the associated dynamic programming problem.