Browsing by Author "Dharmakadar, Aida"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
- An Algorithmic Solution to the Minimax Resource Allocation Problem with Multimodal FunctionsDharmakadar, Aida; Haddad, Emile K. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1993)The 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.
- An algorithmic solution to the minimax resource allocation problem with multimodal functionsDharmakadar, Aida (Virginia Tech, 1993-09-15)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.