TY - JOUR
ID - 4485
TI - Multidimensional Knapsack Problem Based on Uncertain Measure
JO - Scientia Iranica
JA - SCI
LA - en
SN - 1026-3098
AU - Cheng, Li
AU - Rao, Congjun
AU - Chen, Lin
AD - College of Mathematics and Physics, Huanggang Normal University, Hubei 438000, China
AD - School of Science, Wuhan University of Technology, Wuhan 430070, China
AD - College of Mathematics and Sciences, Shanghai Normal University, Shanghai 200234, China
Y1 - 2017
PY - 2017
VL - 24
IS - 5
SP - 2527
EP - 2539
KW - Multidimensional knapsack problem
KW - Uncertain network optimization
KW - Uncertain measure
KW - Discount constraint
DO - 10.24200/sci.2017.4485
N2 - 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.
UR - https://scientiairanica.sharif.edu/article_4485.html
L1 - https://scientiairanica.sharif.edu/article_4485_037bbad2ca12e83ee8047cf15871a171.pdf
ER -