%0 Journal Article
%T Multidimensional Knapsack Problem Based on Uncertain Measure
%J Scientia Iranica
%I Sharif University of Technology
%Z 1026-3098
%A Cheng, Li
%A Rao, Congjun
%A Chen, Lin
%D 2017
%\ 10/01/2017
%V 24
%N 5
%P 2527-2539
%! Multidimensional Knapsack Problem Based on Uncertain Measure
%K Multidimensional knapsack problem
%K Uncertain network optimization
%K Uncertain measure
%K Discount constraint
%R 10.24200/sci.2017.4485
%X The research of classical multidimensional knapsack problem always assumes that the weights,the values and the capacities are constant values. However, in the real-life industrial engineering applica-tions, the multidimensional knapsack problem often comes with uncertainty for lacking of the informationabout these parameters. This paper investigates a constrained multidimensional knapsack problem underuncertain environment, in which the relevant parameters are assumed to be uncertain variables. Withinthe framework of uncertainty theory, two types of uncertain programming models with discount con-straints are constructed for the problem with dierent decision criteria, i.e., the expected value criterionand the critical value criterion. Taking full advantage of the operational law for uncertain variables, theproposed models can be transformed into their corresponding deterministic models. After theoreticallyinvestigating the properties of the models, we do some numerical experiments. The numerical resultsillustrate that the proposed models are feasible and ecient for solving the constrained multidimensionalknapsack problem with uncertain parameters.
%U https://scientiairanica.sharif.edu/article_4485_037bbad2ca12e83ee8047cf15871a171.pdf