Exercice 1: (7 Points) Representation
Exercice 1: (7 Points) Representation
Operational Research
Exercice 1 : (7 points)
1- Write a procedure representation in Python to represent the following graph.
2- By using Dijkstra’s algorithm, write on Python a procedure with input the previous graph and that return
all shortest paths starting at node s.
1- Implement Johnson’s algorithm in Python to determine a sequence of these jobs that will minimise
the total elapsed time.
2- Complete this algorithm in such a way that it returns the minimum elapsed time and the idle time for
each of the machines.
1/2
Maximize P = 3x1 + 4x2 + x3
Subject to :
x1 + 2x2 + x3 ≤ 6
2x1 + 2x3 ≤ 4
3x1 + x2 + x3 ≤ 9
x1 , x2 , x3 ≥ 0
Give the various tables to be entered into Excel to solve this LP using Excel. Solve this LP using Excel.
2/2