Cjelobrojno programiranje

Čulina, Tina (2015) Cjelobrojno programiranje. Diploma thesis, Faculty of Science > Department of Mathematics.

Language: Croatian

Download (256kB) | Preview


Integer linear programming deals with the optimisation problem of linear functional, concerning linear constraints of equality and inequality, where some (or all) variables are additionally restricted to be integer. Scope of integer linear programming usage is wide: production, transport and distribution, marketing, financial and investment planning, employees scheduling etc. The most common methods for solving integer programming problems are branch and bound method and cutting plane method. In this paper we studied the cutting plane method. In the first two chapters we’ve met the theory necessary to prove the main cutting plane method theorem, which says that the integer hull of polyhedral set P can be obtained by cutting its parts in finite number of times. Furthermore, we showed the rating of this finite steps numbers. In the third chapter, we’ve introduced the algorithm of cutting plane method and demonstrated two integer linear programming problem examples, solved with cutting plane method.

Item Type: Thesis (Diploma thesis)
Supervisor: Vrdoljak, Marko
Date: 2015
Number of Pages: 40
Subjects: NATURAL SCIENCES > Mathematics
Divisions: Faculty of Science > Department of Mathematics
Depositing User: Iva Prah
Date Deposited: 13 Jan 2016 11:53
Last Modified: 13 Jan 2016 11:53
URI: http://digre.pmf.unizg.hr/id/eprint/4369

Actions (login required)

View Item View Item

Nema podataka za dohvacanje citata