Subject: Subject Sylbus: Linear and Combinatorial Programming - 098331

Linear and Combinatorial Programming - 098331
Credit
Points
3.5
 
Given In
Semester
a
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
3 1      
Possibility to guided reading

Determination of the grade according to progress during the semester and a final examination.


Prerequisites: Deterministic Models in Oper.Research 094313
 
Overlapping Courses: Combinatorial Optimization 236718


Review of Linear Programming Together with Primal-Dual Method. Revised Simplex Methods. Branch and Bound Methods, Benders Decomposition for Mixed Integer Problems. Elements of Graph Theory. Network Flow Problems - Primal Algorithms. Complementarity Problems. Foundation of Computational Complexity, Efficient Algorithms.




System of hours to the semesters
Semester Previous Semester information 01/2020 2020/2021 Winter Semester

Created in 06/03/2021 Time 01:23:46