Question

Saniyais hosting an Internet auction to sell n widgets. She receives m bids, eachof the form “I want widgets for dollars,”for=1,2,...,. Characterizeher optimization problem as a knapsack problem. Under what conditions is thisa 0-1 versus fractional problem?

Answer 1

Answer:

Sally is hosting an Internet auction to sell n widgets. She receives m bids, each of the form "I want ki widgets for di dollars," for i = 1 , 2 , . . , m. Characterize her optimization problem as a knapsack problem. Under what conditions is this a 0- 1 versus fractional problem?

Expert Answer

100%

Hi, Before going to this problem first of all I wanted to explain the knapsack problem which follows greddy approach to get the maximum profit. There are two types of problem in this : problem 1 : 0-1 knapsack - in this problem we need to take always…