 |  |  |
| MATH0461-1 | Introduction to numerical optimization
|

 |
| Duration : | 30h Th, 30h Pr |
 |
| Number of credits : |
| Master in Electrical Engineering, in-depth approach, 1st year |  | Second semester |  | 5 |
 |
| Master in Electro-mechanical Engineering, Teaching Focus, 2nd year |  | Second semester |  | 5 |
 |
| Master in Computer science, Research Focus, 2nd year |  | Second semester |  | 6 |
 |
| Master in Mechanical Engineering, in-depth approach, 2nd year |  | Toute l'année |  | 5 |
 |
| Master in Engineering Physics, in-depth approach, 1st year |  | Second semester |  | 5 |
 |
| Master in Engineering Physics, in-depth approach, 2nd year |  | Second semester |  | 5 |
 |
| Master en ingénieur civil électricien, à finalité spécialisée en technologies durables en automobile, 1st year |  | Second semester |  | 5 |
 |
| Master in Electrical Engineering, specialized approach, 1st year |  | Second semester |  | 5 |
 |
| Master in Engineering Physics, specialized approach, 1st year |  | Second semester |  | 5 |
 |
| Master in Engineering Physics, specialized approach, 2nd year |  | Second semester |  | 5 |
 |
| Master in Mathematical Sciences, professional focus in computer science, 2nd year |  | Second semester |  | 6 |
 |
|
 |
| Lecturer : | Quentin Louveaux |
 |
Language(s) of instruction :
 |
| English language |
 |
Course contents :
 |
| In a large number of engineering problems, many decisions can be undertaken leading to different solutions, some of them being more interesting than others. A way to decide on the best decision is to come up with a mathematical model in which all decisions are variables and the choice is made by considering a function of the values of all variables.
This formalism modeling many real-life problems is called mathematical programming. In a mathematical program, we define a set of decision variables, constraints linking the variables and defining what is a feasible solution and finally an objective function to optimize. Depending on the properties of all the considered functions, the obtained optimization problem can be more or less difficult to solve. In this course we consider three types of optimization problems: linear problems and their structure (duality), nonlinear problems that keep the nice structure (conic problems) and finally problems without any structure.
The following concepts are studied in the course:
- The revised Simplex Algorithm
- Duality for linear programming
- Post-optimal analysis and the Dual Simplex Algorithm
- Introduction to interior point methods
- Optimality conditions for nonlinear programs
- Conic programming and duality
- Numerical methods for nonlinear methods
This course is given in English. |
 |
Learning outcomes of the course :
 |
| At the end of the course, the student will be able to
- formulate a real problem in terms of a mathematical optimization model
- determine the complexity of an optimization problem and in particular whether it can be solved in polynomial time
- write the dual of a linear or a conic problem
- apply or implement the main optimization algorithms (simplex, dual simplex, interior-point methods, gradient descent, quasi-Newton)
|
 |
Prerequisites and co-requisites/ Recommended optional programme components :
 |
| Basic course in linear algebra and calculus. |
 |
Planned learning activities and teaching methods :
 |
| Traditional tutorials are organized for roughly 20 hours.
A larger project consisting in modeling and solving a real-world problem using a linear programming package is also organized. An optional project of implementation of a nonlinear method can be realized. |
 |
Recommended or required readings :
 |
| D. Bertsimas, J. Tsistsiklis. Introduction to linear optimization, Dynamic Ideas, 1997.
M. Bierlaire. Introduction à l'optimisation différentiable. Presses polytechniques et universitaires romandes. 2006 |
 |
Assessment methods and criteria :
 |
| The exam consists only of exercises. Every material is allowed for consulting during the exam. The exam counts for 75% of the final grade. The modeling project counts for 25%. The optional project counts for 25% and replaces one question of the exam. |
 |
Organizational remarks :
 |
| The course is taught in English. |
 |

|
|  |