Série3 RO Simplexe
Série3 RO Simplexe
Série3 RO Simplexe
Année : 2023-2024
Enseignant : M. Gueye
1
3. Problème de minimisation.
Min f (x1 , x2 ) = 2x1 + 3x2
4x1 + x2 ≥ 5
3x1 + 2x2 ≥ 6
x1 + 2x2 ≥ 3
x1 ≥ 0
x2 ≥ 0
Max z = 6x + 8y
x + 2y ≤6
2x + y ≤ 8
(P L3 )
y≤2
x≥0
y≥0
2
la méthode du simplexe
Max z = 30x1 + 20x2
Max z = 1, 5x1 + 0, 9x2
x1 + x2 ≤ 7 x1 + 0, 5x2 ≤ 100
2x1 + x2 ≤ 9 0, 2x1 + 0, 15x2 ≤ 25
(P L1 ) (P L2 )
3x1 + 2x2 ≤ 8
x2 ≤ 160
x1 ≥ 0 x1 ≥ 0
x2 ≥ 0 x2 ≥ 0
Max z = 200x1 + 300x2
Min z = 24x1 + 20x2
3x1 + 2x2 ≤ 600
x1 + x2 ≥ 30
x1 + 2x2 ≤ 400
(P L3 ) x1 + 2x2 ≥ 40 (P L4 )
x1 + x2 ≤ 225
x1 ≥ 0
x1 ≥0
x2 ≥ 0
x2 ≥0
Max z = 10x1 + 15x2
Min z = x1 + x2
5x1 + 2x2 ≤ 80
x1 + x2 ≥
x1 + x2 ≤ 20
(P L5 ) x1 + x2 ≥ (P L6 )
x1 + 2x2 ≤ 30
≥0
x1
x1 ≥0
≥0
x2
x2 ≥0