A computerised solution to the problem of finding a minimum-cost route through a serial multistage network. The solution is based on a dynamic programming (DP) formulation that is considered to be the best approach for solving such a problem. The input/output matrices for this problem are generally very sparse (about 80%), and thus, their normal storage will tax the memory of a computer very heavily. To alleviate this difficulty. Various storage schemes for sparse matrices were considered and the choice of row-wise packing scheme (being the best) was made to implement the solution. The computer programs thus developed were tested on a small sample problem and were found to be quite efficient. Finally, a suitable strategy has been suggested for solving small-, medium-, and large-size problems on a computer.