Abstract
The multiple-choice multi-period knapsack problem lies on the interface of multiple choice programming and knapsack problems. Previous study of this problem attempted to find its optimal solution through the branch-and-bound procedure using special-orderedsets. In this paper, we propose another solution approach based on the dynamic programming to locate its optimal solution through recursive evaluation of Bellman's equation at each period. We also introduce a set of concise computer code written in IBM's APL2 that solves the problem recursively. Based on this developed APL2 codes, a computational experiment was conducted to further examine the performance of this dynamic programming solution approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
