MATHEMATICAL PROGRAMMING IN SEWER NETWORK DESIGN

This paper addresses itself to the question of obtaining the minimum cost design for a wastewater collection network. It first presents an empirical cost function for a single sewer line. The concept of optimization is then explored with respect lo sewer networks. The design problems of selecting an optimal mix of pipe diameters and slopes, given a set of economic and technological inputs as well as a network layout is then presented in three alternative mathematical programming formulations: separable convex, dynamic and geometric programming. These formulations guarantee the generation of global optimal solutions. Numerical solutions can be obtained using presently available computer capabilities. The paper concludes with an evaluation of the proposed formulations and their implications for both design practice and overall cost reduction in the area of wastewater collection.