I do have a question related to a 0-1 knapsack problem:
I formulated a model with quite a lot of constraints and an objective function on maximizing “balance”. I solved the problem using one of the available commercial solvers (lindo systems). However, would like to put in a couple of extra constraints like;
“the item with the highest balance cannot account for more than 1% of the total balance” (of the solution)
“the item with the 2nd highest balance cannot account for more than 0.5% of the total balance”
Can anyone help me with a solution for such a problem? I have an engineering background, but my math skills are a rusty, so pointers in the right direction would be helpful already.