|Type of course:||Compulsory|
|Language of instruction:||Romanian|
|Erasmus Language of instruction:||English|
|Name of lecturer:||Mihaela Aldea|
|Seminar tutor:||Mihaela Aldea|
|Form of education||Full-time|
|Form of instruction:||Class|
|Number of teaching hours per semester:||42|
|Number of teaching hours per week:||3|
|Form of receiving a credit for a course:||Grade|
|Number of ECTS credits allocated||4|
1. Solving a linear programming problem by graphical and algebraic methods\ 2. Simplex method for solving linear programming problems 3. Duality. The dual simplex algorithm 4. Reoptimization of linear programming problems 5. Parametric linear programming 6. Transport problems. 7. Reoptimization of transport problems. 8. Parametric transport problems. 9. Special transport problem. 10. Integer linear programming – Gomory methods 11. Dantzig-Manne algorithm for solving integer linear programming problems. 12. Bellman method 13. Enumeration and evaluation methods.
Knowing the mathematical basic elements of optimization algorithms, familiarity with the use of optimization techniques and algorithms to solve problems.