Applications of auction algorithms to complex problems with constraints

Linear and nonlinear assignment problems are addressed by the use of auction algorithms. The application of auction to the standard linear assignment problem is reviewed. The extension to nonlinear problems is introduced and illustrated with two examples. Techniques that are employed for model reduction include discretization, classification, and imposition of assignment constraints. The tradeoff between solution speed and optimality for the nonlinear problem is analyzed and demonstrated for the sample problem.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2000

Author dc:creator

• Dukellis, John N. (John Nicholas), 1977-

Advisor dc:contributor.advisor

• Owen Deutsch and Duane S. Boning.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

en_US

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/28455

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/28455