Basic transportation problem is one of the application areas of linear programming problem. As a potential world class university, Covenant University has experienced a considerable increase in human activities has increased considerably in recent times, including vehicular movements. Optimizing cost of transportation of good and services within and outside the university campus is imperative. In this paper, transportation problem model is used to determine the minimal cost of moving perishables from multi-origin to multi-destination in Covenant University. An intense interviews with the destinations (Cafeterias) and origins (Markets) were carried out to obtain the exact data needed for this study. Vogel’s approximation method (VAM) was used to determine the initial basic feasible solution, while Modified Distribution (MODI) method was used to find the optimal solution for each of the major perishable foodstuff considered. The optimal results obtained show the direction the planning or purchasing unit of the university should take in order to minimize the costs associated with university cafeteria services.