Search of optimal connection lines using the graph method

Authors

DOI:

https://doi.org/10.26906/EiR.2023.1(88).2886

Keywords:

shortest grids, grid vertices, fragment, complete graph, incomplete graph, edge, isolated vertex, null graph, connected graph, disconnected graph, graph chain, cycle, tree, closed circuit, algorithm, porphyrian tree

Abstract

The article analyzes the role of mathematical research of economic phenomena and processes. It has been established that many problems of the economy involving finding the optimal distances, time, volume of work, cost, number of objects are solved by the method of constructing graphs. These tasks are reduced to ordering some works, which leads to finding the optimal value of certain values. Comparatively new mathematical problems related to the theory of shortest lines and the theory of graphs, which have practical applications for economics, are considered. The purpose of the article is to apply the theory of shortest lines for solving economic problems. The basis of finding extremums is the method of constructing graphs, which is called porphyrian tree. The article describes the construction of a graph-tree. The properties of the shortest network of segments are defined. Based on the established two properties of the shortest grid, two basic rules for constructing the shortest grid are formulated. and methods of its construction, which is used to solve the optimal planning of production processes. The first of them is that an arbitrary isolated vertex must connect to its nearest neighbor. The second property states that an arbitrary isolated fragment must connect to its nearest neighbor shortest grid. By applying these two rules in any sequence, the shortest grid can be constructed. The paper proposes approximate methods for solving problems of finding optimal lines of various types of road connections. It has been established that each such problem requires a unique approach, which is based on the permutation method. The application of the sorting method to solving problems of sequence and permutations, which boil down to ordering the execution of some works by the method of graphs, is considered. Porphyrian tree presented a set of possible solutions to the problem of the wandering merchant. It has been established that the application of methods of constructing the shortest grid and tree will ensure the construction of some optimal plans of a production, trade and transport nature, will provide opportunities for modeling production processes.

Author Biographies

Olha Vozniak, West Ukrainian National University

PhD in Physical and Mathematical Sciences, Associate Professor of Economic Cybernetics and Informatics Department

Olga Holubnyk, Ivan Franko National University of Lviv

PhD in Economics, Associate Professor of Management Information Systems Department

References

Kardash Ya.A., Tsehelyk H.H. (1998) To the construction of optimal probabilistic binary search trees. Bulletin of Lviv University. Mechanical-mathematical series, 50, 110–117.

Liashchenko M. YA., Holovan M.S. (1996) Numerical Methods. Kyiv : Lebid, 280 p.

Tverdokhlib I.P., Tsehelyk H.H. (1998) The method of determining the stabilized consumption function. Bulletin of Lviv University. Mechanical-mathematical series, 50, 196–200.

Vozniak H.M. (1984) Extreme tasks in extracurricular and optional classes. Applied orientation of the school mathematics course: Solving extreme problems. Kyiv, 80 p.

Published

2023-05-08

How to Cite

Vozniak, O., & Holubnyk, O. (2023). Search of optimal connection lines using the graph method. Economics and Region, (1(88), 166–173. https://doi.org/10.26906/EiR.2023.1(88).2886

Issue

Section

Mathematical methods, models and information technologies in economics