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

DOI10.1155/S0161171288000985MaRDI QIDQ1111468zbMATH OpenFDO

Authors Balasubramanian Ram, A. J. G. Babu

Publication date 1988

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46320

zbMATH Keywords

nonlinear integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Dynamic programming (90C39)

Review text

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.

Recommendations

• Reduction of dimensionality in dynamic programming via the method of diagonal decomposition
• scientific article; zbMATH DE number 95244
• scientific article; zbMATH DE number 3926634
• Reduced-direction methods for the non-linear programming problem
• Nonlinear integer programming for various forms of constraints

Cited in

(3)

• Allocation of dependent divisional resources
• scientific article; zbMATH DE number 95244 (Why is no real title available?)
• scientific article; zbMATH DE number 146430 (Why is no real title available?)

This page was built for publication: Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111468)