Abstract

This study proposes a fuzzy approach for solving the multiobjective and multilevel knapsack problems (KPs). The problem was first formulated as a multilevel programming problem with multiple decision makers (DMs). Then the degree of satisfaction of each DM was established and represented by their individual membership functions. The recursive formulation of dynamic programming was used to solve the decisions of the interrelated stages. The overall satisfaction of the decision was obtained through this stage-wise operation on the hierarchical structure. Capacity allocation was developed and a step-by-step solution procedure was illustrated. A detailed comparison between multiobjective and multilevel KPs was also carried out. Finally, the possible use of turnpike theorem in KPs was scrutinized in the fuzzy domain.

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 call

Disclaimer: 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.