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.


Assignment Problem Dual Problem Reservation Price Transfer Price Homogeneous Product 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Gerald B. Sheblé

There are no affiliations available

Personalised recommendations