Mathematics programmers - Nakonechny S.I.

5.9. Розв'язування транспортної задачі на мережі

The medium of the day-to-day methods in opti- mization and ker- vuvannya with viral processes is significant for the purpose of leaning against the methods . Wide range of problems of mathematical programming can be filed in the least vigil . In particular, the transport tasks are of the highest importance, they can be mulled by the nature of the natural infrastructure as they are, tasks are not affected by the transport routes (dorig, zaliznichnyh, water slides, routes, pipelines, pipelines, etc.). In the second paragraph, the number of typical least-order problems of mathematical programming is outlined.

Naming the graph be-yaku system vidrizkiv (pryamolinicnykh chi krivoliniiynih), the pivniy sposib zedennih mіzh soboju (Figure 5.2).

Signature: Fig. 5.2. Nazvanі vіdіzki, якщо ім it is attributed to the straight, nazyvayutsya arcs of the graph ; Nada , For example: - vidrizok, but the point 1 in point 2 (Figure 5.2).

Points, čo є kíntzimi by the cobs of the arcs of counties, in some mozhut you can call the arcs abo more, call the peaks of the graph : the skin of the peaks is to be known by the number (natural number: 1, 2, 3, 4, ...), for example, Points 1, 2, 3, - vertices (Figure 5.2).

Otzhe, kozhnі duzі vіdpovіada vporjadkovana a pair of peaks , The first index, and the cob of the arc (in), the other index j is the arc of the arc (vihid); We ourselves are given the oriectration (straight) of the arc, which is geometrically reflected in the straight line to the edge of the arc.

Arcs That Nazivayutsya simetricichnimi, obo vzaimenimi , for the application: (2, 4) i (4, 2).

The rib (abo lankoy ) of the graph is called nenapryamleny vidrizok, scho zabrazhaye arc. Significantly ribs are symbols , For example [5, 7] - an edge; Тоді як для відповідних дуг ця рівність не справджується: .

Merezheyu ( abo sittu ) nazivayetsya graph, elements of the yakogo (arcs, peaks, deykimi uch sykupnostyami) have been installed in the performance of the parametre, but viznachayut ich power.

Such parameters can be buti, napriklad, pass zdatnosti shlyahіv, the size of spare parts for chi at the pivnnyh points - the tops of the graph tochno.

Shlyakhom graifi nazivayutsya poslidovnist arc , Кінець кожної з яких збігається з початком наступної, крім останньої (the ear of the skinheads zbіghі збігається з кінцем попередньої, крім першої), тобто ..., .

Shlyah zruchno poznachati poslidovnistyu tops, through yaki vin pass, tobto . With the butt of the helm, the following arcs (1, 2), (2, 3), (3, 5) are assigned (1,2,3,5).

The contour is the name of the route, the topmost point of the road is the one to go to, the back of (1, 2), (2, 3), (3, 5), (5, 1) = (1, 2, 3, 5, 1).

Count nazivayetsya strongly (chi mіtsno) zv'yazanim, yakshcho be-yak yogo top i i j j mozhno z'єdnati shlyhom, sho jde z i in j .

Yakshcho in the signs, the contour and the strongness of the graph comprehend the arc of zameniti ponamettyam rib, then denoted the lancium, the cycle and the count of the graph.

It is easy to zbagnuty, scho ribs of arcs, yak i utzonyutyut shlyah i kontur, zavzhdi ymotoryuyut vidpovidno lanczyug i kiktor, proto gruzorne firmzhennya not spravdzhuyetsya. Tse sama stoosyutsya і зв'язаності: зв'язаний count not обов'язково budey міцно зв'язаним.

Lancium and the cycle are familiar to the analogue to the path and contour, the protuberance of circular vichorostovu square arms, for example, lancuge [1, 2], [2, 3], [3, 4], [4, 6], abo [1, 2, 3, 4, 6]; Cycle [1, 2], [2, 3], [3, 4], [4, 6], [6, 1], abo [1, 2, 3, 4, 6, 1]; Vidpіdnі poslіdovnosti arches do not zavzhdi шля shlyami chi contours.

The tree is called the Earl, which is not a cycle, but in a skinhead the top is called, be it the same as the active ribbon of a lancet.