-x
↑
-
X2·
-
objective
Amount
of
product
I
to
make
Amount
of
product
2
to
make
Goal
:
to
is
Max z
Constraints :
maximize
=
revenue
3x , + 5X2
Machine I
4
X,
2X2 = 12
Machine 2
3x1 + 2x2x18
Machine 3
X1 , X 2
Non-negative constraint
0
X2
18
b
X 1 x4
A
S
2x2x12
1
X26
6
⑧
⑧
If
&
3x1 + 2x2418
At x1
=0
At xz
=
,
0
,
9
(0 9)
x1
6
(6 6)
=
L
Y
Xz =
,
S
,
-
feasible Region
⑨
II
2
I
plug(o 4) to ensure
,
it's left of the
line
⑨
O
3(0) + 2()x18
Ni
2345678910
I
8518
z=
z
=
3x1
+ 5X2
=
30
(10 6)
At
Co 6)Clo 6)
,
,
z2
=
3x 1 + 5xz
3x1 + 5x2
,
=
15
At
(5 3)
At
(2
,
-
z = 30
-z
=
15
(o 3) (5 0
,
,
,
6) -z
=
36
=
highest Amount of
z
is
the
optimal solution
here