Show simple item record

dc.contributor.authorDharmakadar, Aidaen_US
dc.contributor.authorHaddad, Emile K.en_US
dc.date.accessioned2013-06-19T14:37:04Z
dc.date.available2013-06-19T14:37:04Z
dc.date.issued1993
dc.identifierhttp://eprints.cs.vt.edu/archive/00000381/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19868
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_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleAn Algorithmic Solution to the Minimax Resource Allocation Problem with Multimodal Functionsen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-93-39en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000381/01/TR-93-39.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record