prikaz prve stranice dokumenta SIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA
  Download
PDF 1020.5 KB
undergraduate thesis
SIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA
Završni rad
2022. urn:nbn:hr:145:113357
Popović, Ivan
Josip Juraj Strossmayer University of Osijek
Faculty of Economics and Business in Osijek

Cite this document

Popović, I. (2022). SIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA : Završni rad (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:113357

Popović, Ivan. "SIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA : Završni rad." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek, 2022. https://urn.nsk.hr/urn:nbn:hr:145:113357

Popović, Ivan. "SIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA : Završni rad." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek, 2022. https://urn.nsk.hr/urn:nbn:hr:145:113357

Popović, I. (2022). 'SIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA : Završni rad', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek, accessed 25 December 2024, https://urn.nsk.hr/urn:nbn:hr:145:113357

Popović I. SIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA : Završni rad [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek; 2022 [cited 2024 December 25] Available at: https://urn.nsk.hr/urn:nbn:hr:145:113357

I. Popović, "SIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA : Završni rad", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Economics and Business in Osijek, Osijek, 2022. Available at: https://urn.nsk.hr/urn:nbn:hr:145:113357

Please login to the repository to save this object to your list.
Metadata
TitleSIMPLEKS METODA ZA RJEŠAVANJE MODELA LINEARNOG PROGRAMIRANJA : Završni rad
Title (english)SIMPLEX METHOD FOR SOLVING LINEAR PROGRAMMING MODEL : Final paper
AuthorIvan Popović
MentorMartina Briš Alić (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Economics and Business in Osijek
Osijek
Defense date and country2022-09-20, Croatia
Scientific / art field,
discipline and subdiscipline		SOCIAL SCIENCES
Economics
Quantitative Economics
Abstract
Završnim radom iz kolegija Kvantitativne metode za poslovno odlučivanje istražuje se simpleks metoda za rješavanje modela linearnog programiranja. Kroz pregled relevantne, znanstvene literature istražuje se simpleks metoda te njezina primjena pri rješavanju problema linearnog programiranja. U teorijskom dijelu dana je temeljna terminološka distinkcija, vezano za značajne pojmove u radu. U praktičnom dijelu (rezultati istraživanja) prikazan je primjer. Proizvodno poduzeće imalo je dva proizvodna programa koji su proizvodili dva tipa betonskih blokova (A i B). Do rješenja se prvo došlo analitičkom optimizacijom, odnosno simpleks metodom. Nakon toga rješenje se provjerilo u računalnom programu Excel, pomoću dodatka Rješavatelj. Razvidno je i da računalni program Excel koristi simpleks metodu za rješavanje problema linearnog programiranja. Optimalni program proizvodnje je 27,4 blokova prvog tipa (A) i 28,6 blokova drugog tipa (B). Pri tome je neto profit maksimiziran i iznosi 584.077 novčanih jedinica (NJ). Sva ograničenja koja se tiču raspoloživosti gradiva (agregata i cementa) su u potpunosti zadovoljena. U slučaju posljednjeg ograničenja (radni sati) ostalo je neiskorišteno 7,8 sati. U nastavku se razmotrila i Goal Seeking analiza, sa zadanim ciljem ostvarenja neto profita od 600.000 novčanih jedinica. U konačnici, metode, tehnike i alati koje su obuhvaćene operacijskim istraživanjima imaju neizostavnu primjenu u današnjem poslovnom okruženju, olakšavajući menadžerima i zaposlenicima da poboljšaju stupanj produktivnosti i učinkovitosti te ostvare uspješne rezultate.
Abstract (english)
The final thesis written for the Quantitative methods for business decisions explores simplex method for solving linear programming model. Through a review of relevant, scientific literature, the simplex method and its application in solving linear programming problems are investigated. In the theoretical part, a fundamental terminological distinction is given, related to significant concepts in the paper. An example is presented in the practical part (research results). The production company had two production programs that produced two types of concrete blocks (A and B). The solution was first reached by analytical optimization, i.e. the simplex method. The solution was then checked in Excel, using the Solver add-in. It is also evident that the computer program Excel uses the simplex method to solve the problem of linear programming. The optimal production program is 27.4 blocks of the first type (A) and 28.6 blocks of the second type (B). At the same time, net profit was maximized and amounted to 584,077 monetary units (MU). All restrictions regarding the availability of materials (aggregates and cement) are fully met. In the case of the last restriction (working hours), 7.8 hours remained unused. The Goal Seeking analysis was also considered below, with the set goal of making a net profit of 600,000 monetary units. Ultimately, the methods, techniques, and tools covered by operational research have an indispensable application in today’s business environment, making it easier for managers and employees to improve productivity and efficiency and achieve successful results.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:145:113357
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 conditionsOpen access
Terms of useLicence In copyright icon
Created on2023-05-05 09:08:38