METHODS OF SOLVING THE PROBLEMS OF LINEAR PROGRAMMING

U ovom završnom radu pokazani su primjeri rješavanja problema linearnog programiranja pomoću različitih metoda. U linearnom matematičkom optimizacijskom problemu funkcija cilja i ograničenja su linearne funkcije. U prvom dijelu rada definiran je proizvodni problem za koji je postavljen matematički model koji je sveden na dvije varijable P1 i P2. Nakon postavljanja matematičkog modela, u trećem poglavlju pristupa se rješavanju modela i to različitim metodama: analitičkom, grafičkom, simplex te na posljetku računalom (uz pomoć programa MS Excel). U zaključku je napravljena usporedba ovih metoda te objašnjeno konačno rješenje.In this bachelor thesis, cases of solving linear programming problems are presented using different methods. The programming phrase does not necessarily mean programming in a programming language, but it is an optimization problem defining the function of constraints and constraints. The first part defines the manufacturing problem that is set up by a mathematical model that is reduced to two variables P1 and P2. After setting up a mathematical model, the third chapter approaches the solution in various methods: analytical, graphical, simplex and finally computer (with the help of MS Excel). In the conclusion, a comparison of these methods was made