Université Abdelhamid Ibn Badis - Mostaganem 2021/2022

L3 informatique Matière : Programmation Linéaire

Fiche TD N°2 – Solution [Méthode Graphique]

Exercice 1

Max Z= x1+2x2 Max Z= x1+2x2 Min Z= x1+2x2 Max Z= x1+2x2 MaxZ= x1+2x2 Min Z= x1+2x2
x1 ≤ 3 x1 ≤ 3 x1 ≤ 3 x1 ≤ 3 x1≥ 3 x1≥ 3
- x2 ≥ -2 x2 ≤ 2 - x2 ≥ -2 x2 ≥ 2 x2 ≥ 2 x2 ≥ 2
x1 ,x2 ≥ 0 x1 ,x2 ≥ 0 x1 ,x2 ≥ 0 x1 ,x2 ≥ 0 x1 – x2 = 1 x1 – x2 = 1
x1 ,x2 ≥ 0 x1 ,x2 ≥ 0
Solution Z* = 7 Z* = 7 Z* = 0 PL non borné PL non borné Z*=7 ,

( x1* ,x2* )=(3,2) ( x1*,x2*)=( 3,2) (x1* ,x2* )=( (0,0) ( x1* x2*)=( 3,2)

Forme Max Z= x1+2x2 Max Z= x1+2x2 Min Z= x1+2x2 Max Z= x1+2x2 Max Z= x1+2x2 Min Z= x1+2x2
Standard x1 + x3 = 3 x1 + x3= 3 x1 + x3 = 3 x1 + x3 = 3 x1 – x3 = 3 x1 –x3 = 3
- x2 - x4 = -2 x2 + x4 = 2 - x2 - x4 = -2 x2 - x4 = 2 x2 - x4 = 2 x2 - x4 = 2
x1 ,x2 ≥ 0 x1 ,x2 ≥ 0 x1 ,x2 ≥ 0 x1 ,x2 ≥ 0 x1 – x2 = 1 x1 – x2 = 1
x1 ,x2 ≥ 0 x1 ,x2 ≥ 0

Exercice 2
Inconnus – X1 ,X2 : nombre de tables à fabriquer de type 1 et 2 respectivement
MAX Z= 10000X1 + 50000X2 - Résolution graphique solution
X1 + 10X2 ≤ 20 optimale (2, 18/10) Z*=110000
X1 ≤ 2 - Avec Méthode du simplexe : après 2
X 1 , X2 ≥ 0 itérations, on obtient la même solution.

Exercice 3
Min Z=400000 x1 + 100000 x2 Solution optimale (6, 9) Z*=3 300 000
200 x1 + 100 x2 ≥ 1600
6x1 + 6 x2 ≥ 90
-x1 ≥ -12
- x2 ≥ - 9
x1, x2 ≥ 0

Exercice 4
(x1*, x2*) =(3, 1/2) , z*= 21

1 N. Bahnes