On a Realization of One Network Algorithm

Abstract

Among operation research problems, there exist practical problems that can be formulated as network models. Of the results of research of previous years, more than half of the problems on mathematic programming can be realized via network modeling. One of the important problems of network modeling is finding the shortest distance and its realization on a computer. Unlike the known algorithm of finding the shortest distance when we must adopt the formal sum U₁ = 0 and minimizing sum on the following integrations, in the case discussed in this work we maximize the multiplication product and accordingly in the beginning we adopt the formal multiplication product of U₁ = 1. In this work, one problem is solved via two different forms and methods, and an example of its corresponding realization on computer is provided.