I have to do a project where I write a greedy algorithm to maximize a company's sales. There are 6 shelves, each with 8m length. I have to position 100 items whose length, value and max sales possibility I know on those shelves. My problem is, according to my instructions the max sales possibility changes according to the shelf height and the product's position on the shelf. More specifically, it says that the product position at the beginning of the shelf have a max sales possibility that is 30% reduced from those at the end, that the max sales possibility appears at the 4rth shelf and the highest and lowest have 30% of the max. I would really appreciate any help you can give me as my background is not on computer science and I'm pretty lost. I've tried searching for information on bin packing problems but I haven't found anything that matches.
How can i fill shelves with products so that I have the maximum amount of sales?
optimization;greedy algorithms;knapsack problems;packing