Abstract
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.
Even benevolent dictators charge too much.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sheblé, G.B. (1999). Auction as Linear Program. In: Computational Auction Mechanisms for Restructured Power Industry Operation. The Springer International Series in Engineering and Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5157-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5157-7_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7348-3
Online ISBN: 978-1-4615-5157-7
eBook Packages: Springer Book Archive