Development of a computer program for solving network optimization problems.
Abstract
The article is devoted to the development of a computer program for solving network optimization problems for use in the educational process. Many optimization problems can be formulated in the form of one or another optimization problem on graphs. In this regard, the study of the general properties of optimization problems on graphs acquires an independent significance, and the study of methods for their solution is traditionally attributed to the necessary elements of modern education that form an algorithmic way of thinking.
Although the general mathematical formulation of the optimization problem on graphs does not provide any information on possible methods for its solution, all methods for solving such problems can be conditionally divided into two classes:
- most of the known optimization problems on graphs can be formulated in the form of a mathematical model of integer or Boolean programming. In this case, the choice of the way to solve them is completely determined by the mathematical properties of the corresponding problem statement;
- optimization problems on graphs can be solved using special algorithms that take into account the specific features of certain graph objects and the finite cardinality of the set of possible alternatives (combinatorial optimization problems) [9].
The article analyzes the packages of applied programs for calculating network optimization problems and shows the need to develop a computer program to solve these problems. Algorithms for solving network optimization problems (Prim's algorithm, Floyd-Warshall's algorithm and Ford-Fulkerson's algorithm) are presented.
Delphi 7.0 integrated software development environment was chosen to implement the program. The computer program "Calculation of the characteristics of computer networks" has been developed and tested.
References
Anderson J. Discrete mathematics and combinatorics. M .: Publishing house "Williams", 2003. 960 p.
Gorbatov V.A. Fundamental principles of discrete mathematics. M .: Science. Fizmatlit, 2000.544 p.
Osipov D. Delphi. Professional programming. M.: Symbol-Plus, 2006 1056 p.
Discrete mathematics and mathematical problems of cybernetics. Ed. S.V. Yablonsky, A.A. Lupanov. M.: Science, 1974. 278 p.
Kapitonova Yu.V. etc. Fundamentals of discrete mathematics. K .: Naukova dumka, 2002. 579p.
Mathematical bases of theories of telecommunication systems. V.V. Popovsky, S.O. Saburova, V.F. Oliynyk, Yu.I. Losev, DV Ageev et al . Ed. V.V. Popovsky. Kharkiv: SMIT Company LLC, 2006. 564 p.
Melnikov V.N. Logical problems. K.; Odessa: Vyshcha school, 1989. 344 p.
Novikov F.A. Discrete mathematics for programmers. SPb.: Peter, 2002. 304 p.
Ore O. Graph Theory. M .: Mir, 1968.426 p.
Steklov V.K., Kilchytsky E.V. Fundamentals of management of telecommunications networks and services: Textbook. for higher textbook lock in the direction of "Telecommunications". Ed. V.K. Steklova. K .: Tehnika, 2002. 438 p.
Abstract views: 123 PDF Downloads: 182
