prikaz prve stranice dokumenta Problem cjelobrojnog programiranja i primjena u ekonomiji.
Access restricted to students and staff of home institution
undergraduate thesis
Problem cjelobrojnog programiranja i primjena u ekonomiji.
2017. urn:nbn:hr:145:185523
Meleš, Stjepan
Josip Juraj Strossmayer University of Osijek
Faculty of Economics and Business in Osijek

Cite this document

Meleš, S. (2017). Problem cjelobrojnog programiranja i primjena u ekonomiji. (Undergraduate thesis). Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek. Retrieved from https://urn.nsk.hr/urn:nbn:hr:145:185523

Meleš, Stjepan. "Problem cjelobrojnog programiranja i primjena u ekonomiji.." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:145:185523

Meleš, Stjepan. "Problem cjelobrojnog programiranja i primjena u ekonomiji.." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:145:185523

Meleš, S. (2017). 'Problem cjelobrojnog programiranja i primjena u ekonomiji.', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek, accessed 01 April 2025, https://urn.nsk.hr/urn:nbn:hr:145:185523

Meleš S. Problem cjelobrojnog programiranja i primjena u ekonomiji. [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek; 2017 [cited 2025 April 01] Available at: https://urn.nsk.hr/urn:nbn:hr:145:185523

S. Meleš, "Problem cjelobrojnog programiranja i primjena u ekonomiji.", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek, Osijek, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:145:185523

Please login to the repository to save this object to your list.
Metadata
TitleProblem cjelobrojnog programiranja i primjena u ekonomiji.
Title (english)THE PROBLEM OF INTEGER PROGRAMMING AND APPLICATION IN THE ECONOMY
AuthorStjepan Meleš
MentorMartina Briš Alić (mentor)
Committee memberMartina Briš Alić (predsjednik povjerenstva)
Committee memberIvo Mijoč (član povjerenstva)
Committee memberJerko Glavaš (član povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Economics and Business in Osijek
Osijek
Defense date and country2017-09-21, Croatia
Scientific / art field,
discipline and subdiscipline		SOCIAL SCIENCES
Economics
Marketing
Abstract
U modelu LP su uključene sljedeće pretpostavke: veze između promjenljivih su linearne, parametri su konstantni, ne javljaju su slučajne varijable, postoji samo jedna funkcija kriterija i upravljačke promjenljive su neprekidne ne negativne veličine. Iako ove pretpostavke, u konkretnim problemima, nisu uvijek u potpunosti ispunjene, LP daje rezultate koji se uspješno primjenjuju u praksi. Međutim, u nekim primjenama linearnog programiranja, pojedine ili svestrukturne promjenljive mogu imati samo... More cjelobrojne vrijednosti. Na primjer, broj mašina, izvršilaca, vozila, proizvodnih pogona, itd .Ako se radi o relativno velikim brojevima, pogreške zaokruživanja su relativno male tako da je u tim slučajevima prihvatljivo riješiti problem LP sa realnim promjenljivim i dobivene vrijednosti zaokružiti na najbliže cjelobrojne vrijednosti. S druge strane, postoje slučajevi gdje bi se zaokruživanjem pravile grube greške. To se dešava kada su vrijednosti cjelobrojnih rezultata relativno male ili u ekstremnom slučaju, kada promjenljive mogu dobiti samo vrijednosti 0 ili 1. Takvi slučajevi su tipični za situacije donošenja odluka o tome da li nešto uraditi ili ne – da li izgraditi tvornicu, da li zasijati određenu kulturu, da li izvršiti investiranje u određeni projekt. Iako formulacije cjelobrojnih problema programiranja često izgledaju vrlo slično nekim kontinualnim problemima programiranja, sličnost je na neki način zabluda. Algebarski izrazi funkcije cilja i ograničenja u ova dva tipa problema, imaju sličan oblik ,ali dodatna ograničenja, da neke ili sve promjenljive moraju biti cjelobrojne, čine cjelobrojne probleme znatno težim. Mnogi problemi cjelobrojnog programiranja su klasificirani kao teški( hard ) optimizacijski problemi. Tako, dok opći problem LP može biti riješen u polinominalnom vremenu, nalaženje optimalnog rješenja za odgovarajući cjelobrojni zadatak obično zahtijeva eksponencijalno računalno vrijeme. Međutim, postoje neki cjelobrojni problemi koji se mogu lako riješiti. Posebno, mnogi problemi linearnih mreža, kao problemi raspoređivanja i uparivanja ( III matching problems), transportni i problemi pretovara (transshipment problems), problemi mrežnog toka, uvijek kao optimalno rješenje dobiju cjelobrojni rezultat. Less
Abstract (english)
The LP assumes the following assumptions: the links between the variables are linear, parameters are constant, no random variables occur, there is only one criterion function, educational variables are continuous unrelated sizes. Although these assumptions, in specific problems, are not always fully met, the LP yields results that are successfully applied in practice. However, in some linear programming applications, individual or structurally variable can only have integer values. For... More example, the number of machines, executors, vehicles, production plants, etc. With relatively large numbers, rounding errors are relatively small so that in such cases it is acceptable to solve the LP problem with the real variable and gained value rounded to the nearest integer values. On the other hand, there are cases where rounding would make rough mistakes. That's it Occurs when the values of the whole result are relatively small or far-reaching, when the values can only be gained 0 or 1. Such cases are typical for decision-making situations about whether to do something or not - whether to build a plant, plant a certain culture, Whether to make an investment in a specific project. Although the formulations of the overall programming problems often look very similar to some The continual programming problems, the similarity is somehow a mistake. Algebraic expressions of goal and limit functions in these two types of problems have a similar shape, but additional constraints, some or all of them being variable, must make the whole problem much more difficult. Many problems of total programming are classified as hard (hard) Optimization problems. Thus, while the general LP problem can be solved in polynomial time, finding an optimal solution for a corresponding overall task usually requires exponential computer time. However, there are some common problems that can be easily solved. Specifically, many linear network problems such as matching problems, transshipment problems, and network V fault issues always provide the optimal result as an optimal solution. Less
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:145:185523
Study programmeTitle: Marketing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) ekonomije (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) ekonomije)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2017-10-23 14:36:01
accessibility

closeAccessibilityrefresh

If you wish to permanently save changes, click on Save, if not - your settings will be reset when you restart the browser.