Abstract
Resource allocation on a project planning network is modelled as a minimax convex program. A limited budget is to be distributed over the activities of a project so as to minimize the duration of the project or critical path. Conjugate duality is used to simplify the formulation for computational purposes