3 credits, 2 forlecture, 1 for lab, 4 hours per week. Pre-requisites: NA. This course startswith optimization algorithms for combinatorial problems such as greedyalgorithms and local search. Next, linear programming is explained. Then, searchalgorithms are explained for unconstrained nonlinear optimization problems.After that, optimality conditions are explained for nonlinear optimizationproblems with equality and inequality constraints. Finally, this courseexplains multi-objective algorithms to search for a single final solution andmultiple non-dominated solutions.