Abstract
The paper presents the analysis of the transport plan by applying the geometric interpretation of linear programming, dual approach and simplex method to the optimization of the transport plan. The goal is to optimize the transport plan from the aspect of choosing the type of transport task, type and scope of engagement of transport means, in order to maximize the functions of the goal that represents the earnings. The approach to analysis is illustrated by a characteristic task that is solved in the paper in the described way. The main difference between this and the tasks analyzed so far is that the imposed restrictions represent a system of inequalities which, by introducing fictitious variables, is transformed into a system of equations to which the standard maximum problem is applied. The benefit of this approach is a simpler but also more comprehensive approach to the analysis of the transport plan. It is especially suitable for relatively small transport systems when there are a number of limitations and where it is not convenient to buy and use software packages. The emphasis in the paper is on maximizing earnings while meeting the imposed limits. The analysis yielded identical results in all three ways.
Highlights
Simpleks metodu za analitičko rešavanje problema linearnog programiranja, u okviru operacionog
Ova funkcija se odnosi na dobit od eksploatacije p tipova sredstava transporta raspoređenih na nekoliko, m, trasa u toku vremenske jedinice a iskazanih u vidu funkcije cilja: zmax nov.jed. = =c1x1+ c2x2+ c3x3+ c4x4+ c5x5+...+ cpxp
The benefit of this approach is a simpler and more comprehensive approach to the analysis of the transport plan
Summary
Simpleks metodu za analitičko rešavanje problema linearnog programiranja, u okviru operacionog. Simpleks metoda omogućava primenu računarske podrške i formiranje algoritma radi dobijanja optimalnog plana i odgovarajućeg sredstva za korišćenje u okviru nekog saobraćajnog podsistema. Za konačan, relativno mali broj uslova (nametnutih ograničenja, snimljenih stanja ili radnih zadataka koje je u nekom vremenu ili uz neki ograničeni iznos troškova potrebno realizovati) koje je potrebno zadovoljiti dobija se, u prvom prolazu, kako optimalan i fizički dopustivi plan, tako i optimalni tip sredstva za eksploataciju u okviru nekog podsistema. R =m= n - k, pri čemu je k= n – m, broj slobodnih, nezavisno promenljivih veličina xs , s 1,..., k , koje su, po proizvoljnoj pretpostavci prve iteracije, jednake nuli i odnose se na tip sredstava koji se izuzimaju iz eksploatacije. Pri tome se ispunjavaju uslovi, ograničenja,: gj, j=1, ..., n, sl. 1
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
