Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming
Balasubramanian Ram, A. J. G. Babu
International Journal of Mathematics and Mathematical Sciences · 1988
doi:10.1155/s0161171288000985 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.