Question: A company sets an auction for N objects. Bidders place their bids for some subsets of the N objects that they like. The auction

A company sets an auction for N objects. Bidders place their bids for some subsets of the N objects that they like. The auction house has received n bids, namely bids bj for subset Sj, for j = 1,...,n. The auction house is faced with the problem of choosing the winning bids so that profit is maximized and each of the N objects is given to at most one bidder. Formulate the optimization problem faced by the auction house as an integer programming problem.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
