Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming
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.
Saved in:
| Main Authors: | Balasubramanian Ram, A. J. G. Babu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1988-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171288000985 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Mixed-Integer Programming to Solve Distribution Problems
by: Kamil Oruçoğlu, et al.
Published: (2020-12-01) -
A Dynamic Reactive Power Optimization Algorithm for Regional Power Grid Based on Decoupling Interior Point Method and Mixed Integer Programming Method
by: Jie ZHANG, et al.
Published: (2023-01-01) -
IMPLEMENTATION OF INTEGER PROGRAMMING USING THE BRANCH AND BOUND METHOD ASSISTED BY PYTHON IN OPTIMIZING THE PRODUCTION OF COOKIES
by: Nira Nityasa Saranta, et al.
Published: (2024-07-01) -
A Generalized Benders Decomposition for Mixed-Integer Nonlinear Programming: Theory and Applications
by: Fadiah Hasna Nadiatul Haq, et al.
Published: (2024-11-01) -
Comparison of Dynamic Programming Algorithm and Greedy Algorithm on Integer Knapsack Problem in Freight Transportation
by: Global Ilham Sampurno, et al.
Published: (2018-05-01)