Mathematical Optimization Methods

Course objectives

Learning goals The course aims to provide a unified view of the main optimization problems and related solution algorithms. At the end of the course the student is able to classify optimization problems in appropriate categories, formulate optimization models for simple real problems and solve them with the appropriate algorithms and software. Knowledge and understanding. After attending the course the student knows and understands the different classes of optimization problems (Linear Programming, Integer Linear, Non-Linear Convex Programming) and the main solution methods (Simplex Method, Branch and Bound, Cutting Plane, Gradient-based descent methods and Interior point methods). Applying knowledge and understanding. At the end of the course the students are able to recognize real problems that can be modeled as optimization problems and to solve them with the appropriate algorithms and software. Making judgements. Students acquire the ability to classify optimization problems in appropriate categories and to evaluate their computational complexity. They also learn to explore the various aspects related to application problems, to evaluate different modeling options and to analyze the results obtained. Communication skills. Attending the lessons and studying the course material the students acquire the basic language of the discipline. Laboratory activities allow students to acquire the ability to prepare brief documents describing modeling choices and results of a simple case study. Learning skills. After the exam the students are able to attend courses with the various classes of optimization problems. 

Channel 1
ISABELLA LARI Lecturers' profile

Program - Frequency - Exams

Course program
The course aims to provide a unified view of the different optimization problems. The modeling aspects, the basic theoretical elements and the main algorithms are presented. The most relevant applications of optimization in logistics, data analysis, economics and finance are also described. The course is divided into four parts. Linear optimization (about 18 hours) Arguments: Elements of Convex Analysis, Simplex Method, Duality, Dual Simplex Method. Integer Linear Optimization (about 20 hours) Topics: Formulations, Relaxations, Branch and Bound Method, Cutting Plane Method, Dynamic Programming. Non-Linear Convex Optimization (about 18 hours) Optimality conditions, Gradient-based iterative methods, Interior point methods Laboratory activities (about 16 hours) The laboratory activities consist in the solution of optimization problems with the use of specialized software and in the realization of a project on a simple case studies.
Prerequisites
The student must have attended at least one course in Mathematics on Linear Algebra and Mathematical Analysis. Knowledge of a programming language is recommended.
Books
Testi adottati I. Lari, B. Simeone, Dispense di Programmazione Lineare I. Lari , B. Simeone, Dispense di Programmazione Non Lineare L. A. Wolsey, Integer Programming, Wiley
Teaching mode
The course includes both theoretical lessons and laboratory lessons. The theoretical lessons consist of presentation of theoretical aspects and methods and related exercises. The laboratory lectures are held in the computer room and include the presentation of models, the solution of simple problems with the use of specialized software and the solution of case studies.
Frequency
The frequency of the course is strongly recommended. In case of impossibility to follow the lessons, it is advisable to contact the teacher.
Exam mode
The exam includes: (a) the preparation of a written report on the activities carried out during the laboratory lessons; (b) a written test; (c) an oral test. These tests aim to assess the student's ability to solve concrete problems and the knowledge and understanding of the theoretical and algorithmic aspects of the topics of the course.
Bibliography
D. Bertsimas, J.N. Tsitsiklis – Introduction to Linear Optimization – Athena Scientific D. P. Bertsekas – Nonlinear Programming – Athena Scientific H.P. Williams – Model Building in Mathematicl Programming - John Wiley & Sons Inc https://neos-server.org/neos/
Lesson mode
The course includes both theoretical lessons and laboratory lessons. The theoretical lessons consist of presentation of theoretical aspects and methods and related exercises. The laboratory lectures are held in the computer room and include the presentation of models, the solution of simple problems with the use of specialized software and the solution of case studies.
  • Lesson code1055946
  • Academic year2024/2025
  • CourseStatistical Sciences
  • CurriculumData analytics
  • Year1st year
  • Semester2nd semester
  • SSDMAT/09
  • CFU9
  • Subject areaAttività formative affini o integrative