Hello there,

I've been struggling with this problem for a while now, and this seems a good place to ask it. My mathematical knowledge is a bit rusty, so I'm turning to others for help.

This problem is similar to the knapsack issue, in such that I need to find the optimal way to fill a box with items.

Each item has the following properties:
- There's a price for it
- It's got weight
- There's a limited supply of it.

The box needs to be filled according to the following requirements:
- There's a maximum total price set
- There's a maximum total weight set
- At least half of the available items must be used at least once

As you can see, there's quite some limitations to this problem, but, still solvable I think. It's just been a while since I last solved an algorithm like this.

Anyone got any ideas?