OPTIMIZATION METHODS IN MANAGEMENT SCIENCE
Obiettivi formativi
This course introduces students to the theory, algorithms, and applications of optimization for management and decision-making.
It provides a broad overview of the main modeling paradigms used in management science, including linear programming, network optimization, integer programming, and decision analysis.
The course emphasizes the formulation and interpretation of models in business contexts, while exposing students to additional tools such as dynamic programming, nonlinear programming, game theory, and queueing models.
Risultati di apprendimento attesi
Knowledge and understanding: Students will acquire the fundamental concepts and methodological foundations of optimization and decision models used in management science.
Applying knowledge and understanding: Students will be able to formulate real-world business problems as optimization or decision models, select appropriate solution approaches, and interpret results to support managerial decisions.
Making judgements: Students will develop the ability to compare alternative modeling approaches, evaluate assumptions and trade-offs, and select the most appropriate tool depending on the decision context.
Communication skills: Students will be able to clearly present models, assumptions, and results using appropriate technical terminology, and communicate insights to both technical and non-technical audiences.
Learning skills: Students will be able to independently deepen their knowledge of optimization methods and adapt them to new decision-making contexts.
Contenuti Del Corso
Introduction to optimization and modeling. The first part of the course will be dedicated to linear programming before investigating the main models.
Testi Di Riferimento
Main text book:
- Frederick S. Hillier and Gerald J. Lieberman, Introduction to Operations Research, McGraw-Hill.
- Lecture slides and additional teaching materials available on Luiss Learn.
Other text book :
- Wayne L. Winston, Operations Research: Applications and Algorithms, Cengage Learning.
Metodologie Didattiche
The course combines plenary lectures with guided problem solving and exercise sessions. Teaching emphasizes model formulation, intuition, interpretation of results, and applications to management problems.
Modalità di verifica dell'apprendimento
For attending students, continuous assessment counts for 10/30 of the final grade and consists of a midterm exam worth 9/30 plus an attendance component worth 1/30 for attendance above 80 percent. The final exam counts for 20/30 and includes a general section on the second part of the course and a recovery section on the first part for students without a valid midterm. It will contain several exercises. For non-attending or non-compliant students, the final exam counts for 30/30. Exams are closed-book; an official formula sheet may be provided. Grades cannot be refused.
Criteri per l’assegnazione dell’elaborato finale
Students interested in writing a final thesis in optimization or management science are invited to contact the instructor to discuss topic feasibility, methodological requirements, and coherence with the program objectives.
Settimana 1
Introduction to optimization and the modeling approach.
Session 1-2: Theory
Session 3: Exercise session
Reference reading: Hillier and Lieberman, Ch. 1-2.
Settimana 2
Linear programming: Formulation
Content: formulation of an LP problem, decision variables, objective function, constraints, graphical solution and feasible region.
Session 1-2 : Theory
Session 3: Exercises
Reference reading: Hillier and Lieberman, Ch. 3.
Settimana 3
Linear programming: Simplex method
Content : how to solve an LP problem, intuition, duality, and economic interpretation.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 4 and 6.
Settimana 4
LP applications: transportation and assignment problems; basic sensitivity analysis.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 8.
Settimana 5
Network optimization: shortest path, minimum spanning tree, and maximum flow.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 9.
Settimana 6
Integer programming: binary variables, logical constraints, and selected applications.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 11.
Settimana 7
Decision analysis: decision trees, decisions under uncertainty, expected value, and an introduction to nonlinear relationships.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 15/16 depending on edition, plus selected material from Ch. 12.
Settimana 8
Dynamic programming: multistage decision problems and recursive structure.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 10.
Settimana 9
Nonlinear programming: nonlinear objectives and constraints, convexity intuition, and managerial applications.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 12.
Settimana 10
Game theory: strategic interaction, payoff matrices, Nash equilibrium intuition, and business applications.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 14.
Settimana 11
Queueing theory: basic queueing systems, arrival and service rates, congestion, waiting time, and trade-offs between service level and cost.
Session 1-2 : Theory
Session 3 : Exercises
Reference reading: Hillier and Lieberman, Ch. 17.
Settimana 12
Final review and integration of models. Choosing the appropriate tool for different management problems and exam preparation.