Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem.
Tarik BelgacemMhand HifiPublished in: Discret. Optim. (2008)
Keyphrases
- sensitivity analysis
- knapsack problem
- maximum profit
- binary variables
- optimization problems
- managerial insights
- combinatorial optimization problems
- optimal solution
- dynamic programming
- greedy algorithm
- np hard
- linear programming relaxation
- multidimensional knapsack problem
- variational inequalities
- exact algorithms
- influence diagrams
- randomly generated test instances
- implicit enumeration
- decision variables
- multiple objectives
- continuous relaxation
- combinatorial optimization
- probability distribution