Linear Optimization
Code
12145
Academic unit
Faculdade de Ciências e Tecnologia
Department
Departamento de Matemática
Credits
6.0
Teacher in charge
Jorge Orestes Lasbarrères Cerdeira
Teaching language
Português
Objectives
At the end of this course the student will have acquired knowledge and skills that will enable him (i) to model; and (ii) to solve and assess the obtained solutions of linear, integer and multi-objective linear programming problems.
Prerequisites
Students should have knowledge in Linear Algebra, Calculus, and have some skills on algorithms.
Subject matter
1. Linear programming (LP): problem formulation, LP geometry, the simplex algorithm, duality.
2. Integer linear programming (IP): problem formulation, LP vs IP, relaxations, the branch and bound method, heuristics.
3. Multiobjective programming (MOP): problem formulation, solution approaches.
Teaching method
Classes are theoretical/practical with oral presentation of concepts, methodologies, and examples, complemented with problem solving. Specific student difficulties will be addressed during classes or in individual sessions scheduled with the teacher.
Students need to attend a minimum of two thirds of the classes in order to be evaluated. Continuous evaluation is based on three tests. If a student does not obtain approval through continuous evaluation he can try it in an additional examination.
Evaluation method
Rules of evaluation
The student will be excluded of the evaluation if his presences in lessons is inferior to 2/3.
The student may be evaluated by three tests with value 6, 7, and 7 and will be approved if the three tests sum up (rounded) at least 10. The grade will be the rounded sum of the tests.
The student may also be approved by a final exam if the exam''''''''s grade is at least 10. The grade will be the one attained in the exam (rounded) and any grade in any test will be discarded.