Prof. Marta Margarida Braz Pascoal

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• appunti del docente (disponibili sulla pagina Beep del corso)

Argomenti del programma: 1. Introduzione: Problemi decisionali, esempi e caratteristiche. Tipologia dei modelli di ottimizzazione (programmazione matematica). Modelli di programmazione lineare e lineare intera: variabili, vincoli e funzione obiettivo. 2. Programmazione lineare: Forme equivalenti, aspetti geometrici e algebrici. Proprietà fondamentali della programmazione lineare.

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).

• All the course information and material will be available on WeBeep.

Argomenti del programma: 1. Introduction Decision-making problems. Main steps of an O.R. study. Different types of optimization (mathematical programming) problems. Optimization models (decision variables, objective function, constraints) and modeling techniques. 2. Graph and network optimization Optimum spanning trees. Shortest path problems: algorithms for the main variants (including Dynamic programming for acyclic graphs).