Theproposed article present problems that update the issue of mathematical modeling of the system process of designing of new and reconstruction of old engineering networks in the conditions of their perspective development. The analysis of researches in the field of designing of engineering networks taking into account uncertainty of the information is given. The main material of the article is devoted to the construction of a mathematical model of the problem of the network synthesis in the area of action of one regulator of the supply of the target product as component of the developing engineering network design process. The list of questions to be answered when designing a network is given. The problem is solved on a subgraph of the redundant graph of the general design process. It distinguishes the vertex of the regulatorof the supply of the target product, the vertices of the consumers of the target product fed by the regulator, and the permissible communications (arcs) between the consumers. Each communication is matched with its length, indicatorof reliability of functioning, characteristics of quality criteria per unit of communicationlength. Each vertex is matched with an indicatorof reliability of providing the target product. Since thequality criteria are fuzzy numbers with their membership functions, the criteria are normalized forcomparison.Corresponding indicatorfor them, together with the weighting factors, form a generalized quality criterion per unit of communicationlength. The structure of the network has a ring character, for construction of which the vertices of thegraph are divided into subset taking into account the radius of the ring. On the basis of such a graph, a basic mathematical modeling of the Boolean programming problem was built, in which generalized quality criterion are optimized taking into account the restrictions on ensuring supply reliability indicators for consumers. The decomposition process was applied to the constructed model. It allows the solution of the general problem to be reduced to the solution of theBoolean programming problem separately for each vertex in the framework of the search for optimal routes according to the constructed criterion between the previous set of vertices and the set of vertices to which the selected vertex belongs. The work proves the possibilities of such an approach. Based on the developed decomposition, an algorithm for solving the problem of the network synthesis in the area of action of one regulator of the supply of the target productis proposed.