Auction as Linear Program
This chapter demonstrates how to formulate an auction an optimization problem. The main methods of solution are Linear Programming, Linear Programming Assignment Problem, Linear Programming Decomposition, LaGrangian Relaxation, and price decomposition.
KeywordsAssignment Problem Dual Problem Reservation Price Transfer Price Homogeneous Product
Unable to display preview. Download preview PDF.