Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Instructions:
Collaboration: None. This is an individual assignment (although I said in class otherwise). WORK INDIVIDUALLY!
Due date: Tuesday February 26, 2019. 16h05
Submission form: Blackboard. Assignments section.
Grade: 0-100 points according to accuracy and quality of answers.
Notes.
Class notes
Find the SPT for traveling from the origin node to NODE 8.
Use LP Formulation.
What is the C(1,8) cost?
Name your files as: Matricula_H06_Prob1.gms
2 5 5 5 10
7 5 8
10 8 10
9 7 11
4
9
3 9 4 1
12
10
8
9
1 9 6
Find the Shortest-path for traveling from the origin node (Beiging) to Denver.
Use LP Formulation.
What is the C(B, D) cost?
Name your files as: Matricula_H06_Prob2.gms
Use the multi-objective algorithm to find the best cost-time-security paths. Evaluate the best alternatives and indicate with color the best paths they
follow. Use one different diagram to indicate the best route for each attribute.
Dominance rules: Cost: less is best. Time: less is best. Security safety: high is best.