 |  |  |
| MATH0461-2 | Introduction to numerical optimization
|

 |
| Duration : | 30h Th, 20h Pr, 25h Proj. |
 |
| Number of credits : |
| Master in Biomedical Engineering, research focus, 1st year |  | 5 |
 |
| Master in Electrical Engineering, research focus, 1st year |  | 5 |
 |
| Master in Electro-mechanical Engineering, research focus, 2nd year |  | 5 |
 |
| Master of science in computer science and engineering, research focus, 2nd year |  | 5 |
 |
| Master in Computer science, Research Focus, 2nd year |  | 5 |
 |
| Master in Engineering Physics, research focus, 1st year |  | 6 |
 |
| Master in Engineering Physics, research focus, 1st year |  | 5 |
 |
| Master in Engineering Physics, research focus, 2nd year |  | 5 |
 |
| Master in in Electrical Engineering, professional focus in sustainable car technologies, 1st year |  | 5 |
 |
| Master in Electrical Engineering, specialized approach, 1st year |  | 5 |
 |
| Master in Engineering Physics, specialized approach, 1st year |  | 6 |
 |
| Master in Engineering Physics, specialized approach, 1st year |  | 5 |
 |
| Master in Engineering Physics, specialized approach, 2nd year |  | 5 |
 |
|
 |
| Lecturer : | Quentin Louveaux |
 |
Language(s) of instruction :
 |
| English language |
 |
Organisation and examination :
 |
| Teaching in the second semester |
 |
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. |
 |
Mode of delivery (face-to-face ; distance-learning) :
 |
| face-to-face |
 |
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 is oral and counts for 75% of the final grade. The modeling project counts for 25%. The optional project may provide a bonus for the student of 0 to 3 points to the final grade (/20). |
 |
Work placement(s) :
 |
| |
 |
Organizational remarks :
 |
| The course is taught in English. |
 |
Contacts :
 |
| |
 |

|
|  |