International Journal of Mathematics and Mathematical Sciences
Volume 11 (1988), Issue 4, Pages 811-814
doi:10.1155/S0161171288000985
Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming
Balasubramanian Ram1
and A.J.G. Babu2
1Department of Industrial Engineering, North Carolina A \& T State University, Greensboro 27411, NC, USA
2Industrial Systems Department, University of South Florida, Tampa 33620, FL, USA
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.