Optimal repayment policies for multiple loans

This paper extends the applications of scheduling theory to certain problems in the area of finance. Specifically, a branch and bound algorithm to identify optimal repayment policies for multiple loans (credit purchases) has been developed. Each loan qualifies for a discount if it is paid on or before a certain date and a penalty is imposed if it is paid after its due date. These two dates are different in general. It is assumed that the cash for repayment is generated at a constant rate per day and it can be invested so that it continues to earn money until used for repayment. The objective is to minimize the present value of all future cash outflows.