Dynamic programming on an electronic spreadsheet

We develop a Lotus 1-2-3 spreadsheet which can solve the “stagecoach” problem by dynamic programming. More general network models which have multiple initial and/or final states can also be solved by the same approach and the optimal route(s) can be found from the information generated in the spreadsheet. Another example from oil transport technology with eight stages and a maximum of six states is solved by a larger spreadsheet model and the seven alternative routes are found.