Product mix

1) Define Variables
X1 = number of units produced from Cars
X2 = number of units produced from busses
X3 = number of units produced from trains
2) Objective Function

Max Z = 5X1 + 7X2 + 12X3

3) Functional Const
X1 + 2 X2 + 4X3 £ 10 (Machine 1 Constr)

.5X1 + 2X2 + 6X3 £ 10 (Machine 2 Const)

2X1 + 4X3 £ 1200 (Type A Const)

X2 + 5X3 £ 900 (Type B Const)

3X1 + 4X2 + 3X3 £ 2000 (Type C Const)

X1 £ 600 (storage capacity for Cars Const)

X2 = 2(600) (storage capacity for Busses const)

X3 = 3(600) (storage capacity for trains Const)

4) Non-Negativity Const
X1,X2,X3 ³0

Simple simplex
Max Z = 3X1 + 2X2 Max Z = 3X1 + 2X2 + 0S1 + 0S2 + 0S3
St
1. 2X1 + 4X2 £ 20 2X1 + 4X2 + S1 = 20
2. X2 £ 25 X2 + S2 = 25
3. X1£ 15 X1 +S3 = 15
X1,X2 ³ 0 X,S ³ 0
Find the optimal solution using Simplex method
 Basic All X1 X2 S1 S2 S3 RHS Readings
Variables Variables
S1 (Pivot Row) 2 4 1 0 0 20 X1=0
Leaving Variable
X2=0
S2 0 1 0 1 0 25
S1=20
S3 1 0 0 0 1 15
S2=25
Z -3 -2 0 0 0 0 S3=15
Z=0
OT= No
X1 New Row 1 2 1/2 0 0 10 X1=10
X2=0
S2 0 1 0 1 0 25
S1=0
S3 0 -2 -1/2 0 1 5
S2=25
Z 0 4 3/2 0 0 30
S3= 5
Z= 30
OT= yes

• The most -ve number in the Z row to get the pivot column
• The lowest ratio to get the Pivot row (RHS ÷ corresponding in the pivot
column)
• New Row = Old value / Pivot Element
S2
0 1 0 1 0 25 Old Row
-0 (1 2 ½ 0 0 10)
S3
1 0 0 0 1 15
-1 ( 1 2 ½ 0 0 10)
Z
-3 -2 0 0 0 0
+3 (1 2 ½ 0 0 10)
Remaining values = old value – (Corresponding value in the pivot Column)*
(Corresponding in the new row)

Rules
£+S
³ -S + A
= +A
Min = +MA in the objective function
Max = -MA in the objective function
Min we should choose the most +ve number in the Z row, if it’s not optimal.
Max we should choose the most -ve number in the Z row, if it’s not optimal.

Example 1
Min Z = 2X1 + X2 + X3 + 0S1 – 0S2 + MA1 +MA2
ST

X1 + 2X2 £ 100 X1 + 2X2 + S1 =100

X2 +X3 ³ 20 X2 +X3 – S2 + A1 = 20
X1 + 2X2 = 40 X1 + 2X2 + A2 = 40

X1,X2,X3 ³ 0 X,S,A ³ 0
BV All V 2 1 1 0 0 M M RHS Summary
X1 X2 X3 S1 S2 A1 A2
0 S1 1 2 0 1 0 0 0 100 X1=0
M A1 0 1 1 0 -1 1 0 20 X2=0
M A2 1 2 0 0 0 0 1 40 X3=0

Z M-2 3M -1 M-1 0 -M 0 0 60M S1=100

S2=0
A1=20
A2=40
Z=60M
OT = No

BV All V 2 1 1 0 0 M M RHS Summa

ry
X1 X2 X3 S1 S2 A1 A2
S1 1 0 -2 1 2 -2 0 60
X2 new 0 1 1 0 -1 1 0 20
row
A2 1 0 -2 0 2 -2 1 0
Z M-2 0 -2M 0 2M-1 -3M+1 0 20
 TRANSPORTATION Warehouse Demand

Factory Supply

Solution:
1st table
Warehouse (Demand)
1 2 3

1 2 5 + 100 50 0
1
50 50 -1
Factory Supply

-
2
17 9 150 0
2
+6 150 +3
3

+6 6 10 200 150 0
2250
+1 150
+
-
50

50 0 250 150

Total Cost = Transportation Cost * occupied cells

TC = (50*1) + (50*2) + (150*2) + (50*6) + (150*10) =2250

Evaluate the Empty Cells

Cell (1,3) = +5-2+6-10 = -1

Cell (2,3) = +9-2+6-10 = +3

Cell (3,1) = +6-6+2-1 = +1

Cell (2,1) = +7-2+2-1 = +6

Not Optimal

Selected Cell = (1,3) is the most -ve number

Adjustment value = 50

- +

50

+ -

50 150

2nd table
1 2 3

2 5 100
1
50 +1 50

17 +5 9 150
2
150 +3

6 6 10 200
2200
Zero 100 100

50 250 150
First Calculated zero is not written so we need to evaluated this cell

Total Cost = Occupied cells * transportation cost

TC = (50*1) + (150*2) + (100*6) + (50*5) + (100*10) =2200

Evaluate Empty Cells

Cell (1,2) = +2-5+10-6= +1

Cell (2,1) = +7-2+6-10+5-1 = +5

Cell (2,3) = +9-2+6-10 =+3

Cell (3,1) = +6-10+5-1 = 0 OPTIMAL

CPM

1) PERT NETWORK

2) EST ( FORWARD à HEAD / ADD / HIGHER )

3) LAD ( BACKWARD ß TAIL / MINUS / LOWER )
4) PROJECT DURATION ( AKHER NOTE )
5) CRITICAL PATH ( EL TARI2 ELY FYH KOL CRITICAL NOTES )
6) CRITICAL NOTE ( FORWARD = BACKWARD )