The payment scheduling problem

✍ Scribed by Richard C. Grinold

• Publisher: John Wiley and Sons
• Year: 1972
• Tongue: English
• Weight: 548 KB
• Volume: 19
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.3800190110

✦ Synopsis

Large complicated projects with interdependent activities can be described by project networks. Arcs represent activities, nodes represent events, and the network's structure defines the relation between activities and events. A schedule associates an occurrence time with each event: the project can be scheduled in several different ways. We assume that a known amount of cash changes hands at each event. Given any schedule the present value of all cash transactions can be calculated. The payment scheduling problem looks for a schedule that maximizes the present value of all transactions.

This problem was first introduced by Russell [2]; it is a nonlinear program with linear constraints and a nonconcave objective. This paper demonstrates that the payment scheduling problem can be transformed into an equivalent linear program. The linear program has the structure of a weighted distribution problem, and an efficient procedure is presented for its solution. The algorithm requires the solution of triangular systems of equations with all matrix coefficients equal to k1 or 0.