Quantitative Methods

Lecture (1)
Quantitative Methods:
1. Linear programming- Graph Method (Lec 1+2)
2. Linear programming- Simplex Method. (Lec 3+4)
3. Games theory. (Lec 5)
4. Assignment Model + Transportation Model. (Lec 6)
5. Testing the initial transportation table.(Lec 7)
6. PERT Network. (Lec 8).
7. Revision. (Lec 9)
8. Trial Exam. (Lec 10)
…………………
Graph Method

- Main goal (z), objective function (Max profit –

Min cost).
- Constraints.
- Non negative restriction.
……………..

1
Example (1):
Type 1: (x) Type 2: (y)
Objective function:
Max z =10 x + 90 y

Type 1 Type 2 Available

(x) (y)
Material 4 6 360
Labor 3 2 150

Constraints:
Material 4x + 6y ≤ 360
Labor 3x + 2y ≤ 150

Non negative restriction: x, y ≥ 0

……..
Transform to equations:
Material 4x + 6y =360
Labor 3x + 2y =150

2
Intersection point:
4x + 6y =360 4x+6y =360
3x + 2y =150 Multiply×3 9x+6y=450
…………………….
Equation (2) - Equation (1)
5x= 90 then x=90÷5=18
Using first EQN:

4x + 6y =360
4(18) + 6y =360
72 + 6y = 360
6y= 360 – 72 = 288 then y=288÷6=48
Intersection point (18,48)
…………….
Graph
4x + 6y =360 3x + 2y =150
x=0 y= 60 x=0 y=75
y=0 x= 90 y=0 x=50

Graph

3
80

70

60

50

40

30

20

10

0
0 20 40 60 80 100

Points: Max z =10 x + 90 y

(50, 0) z =10 (50) + 90 (0) = 500

(0, 60) z =10 (0) + 90 (60) = 5400 Max
(18, 48) z =10 (18) + 90 (48) = 4500

x= 0 , y= 60 , Maximum Profit=5400
…………………..

4
Example (2):
Type 1: (x) Type 2: (y)
Objective function:
Max z =40 x + 50 y
Products Labor Clay
x 1 4
y 2 3
Availability 40 120

Constraints:
Labor x + 2y ≤ 40
Clay 4x + 3y ≤ 120

Non negative restriction: x, y ≥ 0

……………….
Equations:
Labor x + 2y = 40
Clay 4x + 3y = 120

Intersection point:
x + 2y = 40 multiply ×4 4x+8y=160
4x + 3y = 120 4x + 3y = 120
………………………….
5y = 40 , y= 40/5= 8
First EQN:
x + 2(8) = 40
5
x+16= 40 , then x= 40-16=24 (24,8)

Graph:
x + 2y = 40 4x + 3y = 120
x=0 y=20 x=0 y=40
y=0 x=40 y=0 x=30

45

40

35

30

25

20

15

10

0
0 5 10 15 20 25 30 35 40 45

Points: z= 40x +50y

(30,0) z= 40(30) + 50(0)= 1200
(0,20) z= 40(0) + 50(20)= 1000
(24,8) z= 40(24) + 50(8)= 1360 max
……………………………………..

6
Ex:
Objective function:
Min z = 20 x1+ 15x2
Subject to:
x1 + 2 x2 ≥ 8
3 x1 + 2 x2 ≥ 12
x1 , x2 ≥ 0

Solution
Transform to equations:
x1 + 2 x2 = 8
3 x1 + 2 x2 = 12

Second equation – first equation

3 x1 + 2 x2 = 12
x1 + 2 x2 = 8
2x1= 4 , x1= 4÷2=2
Using the first equation:
x1 + 2 x2 = 8
2 + 2 x2 = 8
2 x2 = 8-2 = 6
x2 = 6÷2 =3

7
Min z= 20 x1+ 15x2
Min z= 20 (2) + 15(3) = 85
…………….
Graph:
x1 + 2 x2 = 8 3 x1 + 2 x2 = 12
x1 =0 , x2= 4 x1 =0 , x2= 6
x2 =0 , x1= 8 x2 =0 , x1= 4

Graph
7

0
0 1 2 3 4 5 6 7 8 9

8
Points: z = 20 x1+ 15x2
(8,0) z = 20 (8)+ 0 =160
(0,6) z = 0+ 15(6) =90
(2,3) z = 20 (2) + 15(3) = 85
Least cost = 85
…………………………….
Assignment
Ghabbour Auto Company produces 2 types of products; the
following table shows their data:
Accent Elantra Availability
Material 1 2 8
Hours 3 2 12
Profit 15 20 --
By using graph method, answer the following points:
1- Objective function will be………..
2- First constraint will be…………..
3- Second constraint will be…………
4- Non negative restriction will be……..
5- According to an optimal solution maximum profit will
be……..
6- According to an optimal solution, value of the first product (x)
will be…..
7- According to an optimal solution, value of the second
product(y) will be……
………………………………….
Link:
https://www.zweigmedia.com/utilities/lpg/index.html?lang=en