Showing 1 - 2 of 2
This paper solves the binary single-constrained Knapsack Problem (KP) and undertakes a sensitivity analysis of its optimum solution. Given a knapsack of capacity c, and a set of n items, with each item j, j = 1,…,n, characterised by a weight wj and a profit pj, the binary...
Persistent link: https://www.econbiz.de/10008563657
This paper solves the binary single-constrained Knapsack Problem (KP) and undertakes a sensitivity analysis of its optimum solution. Given a knapsack of capacity c, and a set of n items, with each item j, j = 1,?,n, characterised by a weight wj and a profit pj, the binary single-constrained KP...
Persistent link: https://www.econbiz.de/10005225945