Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
A Stochastic Competitive R&D Race Where “Winner Takes All”
Operations Research
Hi-index | 0.00 |
In order to reduce the risk of complete failure, research managers often adopt a parallel strategy by simultaneously funding several R&D activities and several research teams within each activity. The parallel strategy requires the allocation of an available budget to a number of R&D activities, the determination of the number of research teams within each activity and the amount of funding they receive. We consider a formulation of this problem as a nonlinear resource allocation problem by Gerchak and Kilgour, IEE Trans. 31 (2) (1999) 145, and present a sufficient condition as a function of problem parameters, under which closed-form solutions to the problem are obtained.