Continuous Maximin Resource Allocations with GLB and GUB Constraints

일반하한 및 일반상한 제약하의 연속 최대최소 자원배분

We present a continuous resource allocation problem with maximin objective functions under the generalized lower bound(GLB) and generalized upper bound(GUB) constraints. This problem is an extension for the problems of previous studies. An efficient algorithm is developed by exploiting extended structural properties, where n is the total number of variables. The worst computational complexity of the proposed algorithm is O(nlogn).