Insentive mechanisms to reduce projects execution time under linear expense functions

Incentive problems to reduce projects execution time are put. The optimal unified linear incentive scheme is found that reduces project execution time. The solution is based on the notions of network path capacity and the power of a cutset. A sort of duality theorem is proven to establish the equality of the maximum ways capacity and the minimum power of cutsets.