Volume 24, Issue 1 (7-2005)
2005, 24(1): 47-57 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
K. Eshghi and H. Djavanshir. An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem. Computational Methods in Engineering 2005; 24 (1) :47-57
URL: http://jcme.iut.ac.ir/article-1-332-en.html
URL: http://jcme.iut.ac.ir/article-1-332-en.html
Abstract: (3317 Views)
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient algorithm is developed to find surrogate multipliers in each stage of dynamic
programming in order to transform the original problem to a single constraint problem called surrogate problem. The upper and lower bounds obtained by solving the surrogate problem can eliminate a large number of state variables in dynamic programming and extremely reduce the duality gap according to our computational results.
