AbstractThe application is described of two alternative methods of solution, employing Dynamic Programming and Lagrange's Multipliers, respectively, to a problem of calculating the minimum fuel consumption of a bus fleet. In essence the problem is how to divide up the time scheduled for a complete journey amongst the intermediate sections in order to minimize the total fuel consumption.