| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:REŠEVANJE MEŠANO CELOŠTEVILSKIH NELINEARNIH PROBLEMOV Z DEKOMPOZICIJSKIMI IN RELAKSACIJSKIMI METODAMI
Authors:Čuček, Šolasta (Author)
Novak Pintarič, Zorka (Mentor) More about this mentor... New window
Kravanja, Zdravko (Co-mentor)
Files:.pdf UN_Cucek_Solasta_2016.pdf (1,74 MB)
 
Language:Slovenian
Work type:Undergraduate thesis (m5)
Typology:2.11 - Undergraduate Thesis
Organization:FKKT - Faculty of Chemistry and Chemical Engineering
Abstract:Diplomsko delo obravnava razvoj optimizacijskih metod v strukturi mešano celoštevilskega linearnega programiranja in tudi zahtevnejšega mešano celoštevilskega nelinearnega programiranja, katerega razvoj se je začel v šestdesetih letih 20. stoletja. Optimizacijske metode se danes razvijajo zelo hitro, prav tako njihova uporaba v kemijski tehniki, in sicer v sistemski procesni tehniki, ki se neprestano dopolnjuje. Hkrati razvoj optimizacijskih metod predstavlja izziv za znanstvenike na področju matematičnega programiranja, gradbeništva, elektrotehnike, managementa in seveda kemijske tehnologije. Zaradi razvoja optimizacijskih metod sta v diplomskem delu obravnavani dve metodi, in sicer splošna Bendersova dekompozicija in zunanja poenostavitev s sprostitvijo enačb v strukturah mešano celoštevilskega (ne)linearnega programiranja. Prikazana, opisana in rešena sta dva primera za vsako strukturo. Na podlagi števila iteracij je bilo ugotovljeno, da potrebujejo relaksacijske metode manj iteracij in krajši računalniški čas kot izbrana dekompozicijska metoda, s čimer je bila zastavljena hipoteza potrjena.
Keywords:optimizacijske metode, mešano celoštevilsko linearno programiranje, mešano celoštevilsko nelinearno programiranje, splošna Bendersova dekompozicija, modeliranje, procesna sistemska tehnika
Year of publishing:2016
Publisher:[Š. Čuček]
Source:Maribor
UDC:519.853:66.011(043.2)
COBISS_ID:20334614 Link is opened in a new window
NUK URN:URN:SI:UM:DK:2IKJUZYR
Views:571
Downloads:68
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FKKT
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:SOLVING MIXED INTEGER NONLINEAR PROBLEMS USING DECOMPOSITION AND RELAXATION METHODS
Abstract:This diploma work deals with the development of optimization methods in the structure of mixed integer linear programming and also more difficult mixed integer nonlinear programming, whose development started in the sixties of the 20th century. Optimization methods are nowadays developing very fast, and also their use in chemical engineering, particularly in process systems engineering, which is constantly advancing. The development of optimization methods at the same time presents a challenge for scientists in the fields of mathematical programming, civil engineering, electrical engineering, management and also chemical engineering. Due to the development of optimization methods, this diploma work deals with two of the methods, General Benders Decomposition and outer approximation with equality relaxation in the structures of mixed integer (non)linear programming. Those two methods are described in more details, and demonstrated by two examples for each structure. It was found, based on the number of iterations that relaxation methods need less iterations and shorter computational time than selected decomposition method. The hypothesis was thus confirmed.
Keywords:optimization methods, mixed integer linear programming, mixed integer nonlinear programming, General Benders decomposition, modelling, process systems engineering


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica