Graphical solutions

Minimize z=3X1+2X2

Subject= 5X1+X2>10
X1+X2>6
x1+4x2=12

soluation
A B
4 2
Z= 3 2
Z (value )= 16

subject=
X 5 1 10
Y 1 1 6
Z 1 4 12
X(value)= 22
y(value)= 6
z(value)= 12
 Graphical solutions

maximize z=-X1+2X2

Subject X1-X2<=-1
0.5X1+X2<=2

soluation
A B
2 3
Z= -1 2
Z (value )= 4

subject=
X 1 -1 -1
Y -0.5 1 2
X(value)= -1
y(value)= 2
 Graphical solutions

Minimize z=20X1+10X2

Subject X1+2X2<=40
3X1+X2>=30
4x1+3x2>=60

soluation
A B
6 12
Z= 20 10
Z (value )= 240

subject=
X 1 2 40
Y 3 1 30
Z 4 3 60
X(value)= 30
y(value)= 30
z(value)= 60
 simplex method

maximize z=3X1+4X2

Subject X1+X2<=450
2X1+X2<=600

soluation
A B
0 450
Z= 3 4
Z (value )= 1800

subject=
X 1 1 450
Y 2 1 600
X(value)= 450
y(value)= 450
 simplex method

Minimize z=12X1+20X2

Subject 6X1+8X2>=100
7X1+12X2>=120

soluation
A B
15 1.25
Z= 12 20
Z (value )= 205

subject=
X 6 8 100
Y 7 12 120
X(value)= 100
y(value)= 120
 simplex method

maximize z=5X1+3X2

Subject 2X1+X2<=1
X1+4X2>=6

soluation
A B
0 1
Z= 5 3
Z (value )= 3

subject=
X 2 1 1
Y 1 4 6
X(value)= 1
y(value)= 4