Automatization of solving the extremal problems on graphs in radioelectronic apparatus design

Authors

  • L. K. Hlinenko Lviv Polytechnic National University, Lviv
  • V. M. Fast Lviv Polytechnic National University, Lviv

DOI:

https://doi.org/10.20535/RADAP.2013.54.90-101

Keywords:

graph, adjacency matrix, path, spinning tree, transport problem, transit point, optimization, MS Excel Solver

Abstract

Possibilities of solving by MS Excel Add-in Solver the REA design problems modeled as the extremal graph problems are considered. Offered problem models enable to find extreme paths and minimum vertex covers (minimum spinning trees) for the graphs of any complexity. Constraints of graph connectivity for optimal routes are introduced in the model. These constraints are realized as constraints of flow balance in transit network points. That allowed to add the problem up to a linear programming problem, solving of which is correctly supported by MS Excel Solver common procedures.

Author Biographies

L. K. Hlinenko, Lviv Polytechnic National University, Lviv

Hlinenko Larysa, Cand. of Sci(Techn), Assoc. Prof.

V. M. Fast, Lviv Polytechnic National University, Lviv

Fast Volodymyr, Cand. of Sci(Techn), Assoc. Prof.

References

Література

Werneck R.F. Shortest Paths and Experimental Evaluation of Algorithms. – Microsoft Research / Renato F. Werneck – SiliconValley:MIDAS. – 2010. – 123 р., рр. 107 – 116.

Кузьмичов А. І. Математичне програмування в Excel: Навч. посіб. / А. І.Кузьмичов, М.Г. Медведєв М. Г. – К. Вид-во Європ. Ун-ту, 2005 – 320 с.

Sedgewick R. Algorithms in С++. Graph Algorithms / R. Sedgewick. – Addison Wesley Longman, 2002., 496 p., pp. 251 - 311.

Таха Х. Введение в исследование операцій / Х.Таха. – М. : «Вильямс», 2001. – 912 с.

References

Werneck R.F. Shortest Paths and Experimental Evaluation of Algorithms. – Microsoft Research / Renato F. Werneck – SiliconValley:MIDAS. – 2010. – рр. 107 – 116.

Kuzmichov A. I. Matematychne programuvannia v Excel / A.I. Кузьмичов, M.H. Meedvedev. – K. : Vyd-vo Yevrop. Un-tu, 2005 – 320 s.

Sedgewick R. Algorithms in С++. Graph Algorithms / R. Sedgewick. – Addison Wesley Longman, 2002., 496 p., pp. 251 - 311.

Takha Kh. Vvedenie v issledovanie operatsii / Kh. Takha. – M. : «Viliams», 2001. – 912 s.

Downloads

Published

2013-11-01

How to Cite

Гліненко, Л. К. and Фаст, В. М. (2013) “Automatization of solving the extremal problems on graphs in radioelectronic apparatus design”, Visnyk NTUU KPI Seriia - Radiotekhnika Radioaparatobuduvannia, 0(54), pp. 90-101. doi: 10.20535/RADAP.2013.54.90-101.

Issue

No. 54 (2013)

Section

Designing of Radio Equipment

License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).