Subject: Optimization Algorithms and Nonlinear Programming (17 - IFE215)


Basic Information

CategoryScientific-professional
Scientific or art field:Automatic Control and System Engineering
InterdisciplinaryNo
ECTS8
Native organizations units

Course native organizational units not found!
Course specification

Course is active from 01.10.2005..


Precondition courses

Course idMandatoryMandatory
Mathematical Analysis 1YesYes

Course which have preconditioned courses Optimization Algorithms and Nonlinear Programming

Course idMandatoryMandatory
Operational ResearchYesYes
Students learn about theoretical and practical bases of non-linear optimization of static and dynamic systems.
Students will lear to recognize, formulate and solve optimization problems, i.e. tasks involving identification of the best admissible solution of a given problem. Optimization problems are ubiquotious in engineering. Having in mind the existence of broad plaethora of optimization methods, the students will learn how to recognize the one best suited for the problem at hand, as well as how to implement the chosen method in the concrete situation.
Formulation of optimization problem. Theoretical bases of static optimization. Analytical system determination, functions of one or more variables without constraints. Analytical determination of extremes, functions of one or more variables with constraints on the type of equality and inequality. Linear programming. Numerical solutions of one-dimensional problems. Numerical solutions of multi-dimensional problems with and without constraints. Dynamic programming. Modern optimization procedures: genetic algorithm, simulated annealing, PSO. Application of optimization procedures in training artificial neural networks and fuzzy logic systems. Examples of optimization of practical engineering problems.
Lectures, Numerical and calculation practice. Computer practice. Laboratory practice. Consultations. The examination is written and oral. The written part consists of at least four parts, in order to achieve a passing grade min 50 % each task must be completed successfully. The course material can be divided into two colloquia. The oral part of the examination is based on a list of examination questions. The colloquia, tests and examination are written. The written part is eliminating. The final grade is formed on the basis of colloquia, homework assignments, written and oral part of the examination.
AuthorsNameYearPublisherLanguage
Petrić, J., Zlobec, S.Nelinearno programiranje1983Naučna knjiga, BeogradSerbian language
Vujanović, B., Spasić D.Metodi optimizacije1998Univerzitet u Novom Sadu, Novi SadSerbian language
Dimitri P. Bertsekas Nonlinear Programming 2004 Athena Scientific English
Kanović, Ž., Rapaić, M., Jeličić, Z.Evolutivni algoritmi u inženjerskoj praksi2017Fakultet tehničkih nauka, Novi SadSerbian language
Nocedal, JorgeNumerical Optimization2006SpringerEnglish
Course activity Pre-examination ObligationsNumber of points
ProjectYesYes30.00
Coloquium examNoNo40.00
Oral part of the examNoYes30.00
Practical part of the exam - tasksNoYes40.00
Name and surnameForm of classes
Missing picture!

Jeličić Zoran
Full Professor

Lectures
Missing picture!

Kapetina Mirna
Associate Professor

Lectures
Missing picture!

Mirković Milan
Full Professor

Lectures
Missing picture!

Kičić Aleksandar
Assistant - Master

Practical classes
Missing picture!

Golić Anastasija
Teaching Associate

Practical classes
Missing picture!

Zarić Dragan
Teaching Associate

Practical classes
Missing picture!

Živanović Nikolina
Teaching Associate

Practical classes
Missing picture!

Živanović Nikolina
Teaching Associate

Computational classes
Missing picture!

Zarić Dragan
Teaching Associate

Computational classes
Missing picture!

Golić Anastasija
Teaching Associate

Computational classes
Missing picture!

Kičić Aleksandar
Assistant - Master

Computational classes