An Algorithmic Solution to the Minimax Resource Allocation Problem with Multimodal Functions

dc.contributor.authorDharmakadar, Aidaen
dc.contributor.authorHaddad, Emile K.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:04Zen
dc.date.available2013-06-19T14:37:04Zen
dc.date.issued1993en
dc.description.abstractThe problem of allocation is one of the most widely investigated topics in the area of mathematical optimization because of its broad applicability to different classes of real world problems. The basic idea is that, given some type of resource whose total amount is N, we want to partition and allocate the total resource over n activities to minimize some objective function, F, whose value represents the "cost" of the allocation. As can be seen from various research results in this area, the procedures to solve discrete and continuous resource allocation problems can be significantly different. One obvious basic difference is that the discrete problem can be exactly solved by exhaustive enumeration, while the continuous problem cannot.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000381/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000381/01/TR-93-39.pdfen
dc.identifier.trnumberTR-93-39en
dc.identifier.urihttp://hdl.handle.net/10919/19868en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleAn Algorithmic Solution to the Minimax Resource Allocation Problem with Multimodal Functionsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR-93-39.pdf
Size:
3.05 MB
Format:
Adobe Portable Document Format