An algorithmic solution to the minimax resource allocation problem with multimodal functions

An algorithmic approach is developed for solving the minimax continuous resource allocation problem with multimodal cost functions. Unlike previous research in the same area which developed solutions for the same problem by imposing restrictions on the cost functions, such as the assumptions of monotoniciy or convexity, this approach is applicable to problems with multimodal functions with a finite number of local extrema. Another significant advantage demonstrated by this approach is that it provides all the optimal solutions to the problem; in contrast to previous algorithms which provided a single optimal solution. When a further level of optimization using a second objective function is desired, one needs the entire set of optimal solutions as provided by the procedures of this thesis.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Computer Science and Applications

Department dc:contributor.department

Computer Science and Applications

Grantor dc:publisher

Virginia Tech

Year dc:date.issued

1993

Author dc:creator

• Dharmakadar, Aida

Chair dc:contributor.committeechair

• Haddad, Emile K.

Committee members dc:contributor.committeemember

• May, William
• Schneider, Richard E.

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Language dc:language.iso

en

Dc Identifier Other

etd-10062009-020310

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/45037