Scribd
Upload
50 views18 pages

Quantitative Methods: Instructor: DR: Abdelhamid Mostafa

The document provides an example of using the assignment model to minimize costs in assigning workers to machines. It shows the steps of row reduction, column reduction, and covering all zeros with lines to find the optimal assignment. The example matrix represents worker processing times for 3 machines. After applying the simplex method steps, the optimal assignment is found with a minimum total cost of 78.

Uploaded by

Nourhan Khaled
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
50 views18 pages

Quantitative Methods: Instructor: DR: Abdelhamid Mostafa

The document provides an example of using the assignment model to minimize costs in assigning workers to machines. It shows the steps of row reduction, column reduction, and covering all zeros with lines to find the optimal assignment. The example matrix represents worker processing times for 3 machines. After applying the simplex method steps, the optimal assignment is found with a minimum total cost of 78.

Uploaded by

Nourhan Khaled
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Quantitative Methods

Lecture 6
Instructor:
Dr: Abdelhamid Mostafa
Exercise(1)
Maximize Z= 20x+12y
Where:
3X+2y ≤ 15
2X+3y ≤ 15
X,y≥0
We obtained the second table of simplex as
follow:
The second table:
Constants
s2 s1 y x Main
Variables

? ? -20/3 -4/3 ? Z
? ? 1/3 2/3 ? x
? ? -2/3 5/3 ? s2
Complete this table , and illustrate is this table
considered as the optimal solution?
Solution
Constants
s2 s1 y x Main
Variables

-20/3 -4/3 Z
-100 0 0
1/3 2/3 x
5 0 1
-2/3the number
5/3 s2
5
Intersections 1
= 1 , and 0 column=0
in
Profit: z= 20x+12y=20(5)+12(0)=100
Constants column:
Matrix of slack variables × available resources
1/3 0 × 15
-2/3 1 15
=1/3 × 15 + 0 = 5
=-2/3 × 15 + 1 × 15 = 5
This table is the optimal solution because there
is no positive values in z row.
Exercise(2)
Maximize Z= 8x+6y
Where:
2X+ y ≤ 7
X+2y ≤ 8
X,y≥0
We obtained the second table of simplex as
follow:
The second table:
Constants
s2 s1 y x Main
Variables

? ? -4 2 ? Z
? ? 1/2 1/2 ? x
? ? -1/2 3/2 ? s2
Complete this table , and illustrate is this table
considered as the optimal solution?
Solution
Constants
s2 S1 y x Main
Variables

-4 2 Z
-28 0 0
1/2 1/2 x
7/2 0 1
-1/2the number
3/2 S2
9/2
Intersections 1
= 1 , and 0 column=0
in
Profit: z= 8x+6y=8(7/2)+6(0)=28
Constants column:
Matrix of slack variables × available resources
1/2 0 × 7
-1/2 1 8
=1/2 × 7 + 0 = 7/2
=-1/2 × 7 + 1 × 8 = 9/2
This table is not the optimal solution because
there is positive values in z row .
Main column (y)..max positive number in (z) row

Main row
x=7/2÷1/2 =7
S2=9/2÷3/2=3 (least number) Main row(s2)
Key number=3/2 (intersection between the main
column and the main row)
‫ونتنتتا‬
Main row÷ key number(3/2)=(0 ,1 ,-1/3 ,2/3 , 3)
Z row: x row:
2-(0×2)=0 1-(0×1/2)=1
2-(1×2)=0 1/2-(1×1/2)=0
-4-(-1/3×2)=-10/3 1/2-(-1/3×1/2)=2/3
0-(2/3×2)=-4/3 0-(2/3×1/2)=-1/3
-28-(3×2)=-34 7/2-(3×1/2)=2
The third table
Constants s2 S1 y x Main
Variables

-34 -4/3 -10/3 0 0 Z


2 -1/3 2/3 0 1 x
3 2/3 -1/3 1 0 y

This table is the optimal solution because there


is no positive values in z row.
Assignment Model
Objective: to assign a worker to each machine so
that we can minimize the total cost of wages
or the time needed to finish the product.
Steps:
1- Rows reduction.
2- Columns reduction.
3- Cover all zero in the matrix by lines(number of
rows= number of columns = number of lines)
Exercise(1)
The assignment model in the form of worker-
machine matrix is show below:
Orders
)3( )2 ( )1( Machines
26 26 30 A
45 30 28 B
24 35 25 C

Find the minimum cost


Solution
Step 1: Rows reduction
From the last table, choose the least number in
each row and subtract it from numbers of the
same row:
)3( )2 ( )1( Machines
0 0 4 A
17 2 0 B
0 11 1 C
Step 2: Columns reduction
From the last table, choose the least number in
each column and subtract it from numbers of
the same column :
)3( )2 ( )1( Machines
0 0 4 A
17 2 0 B
0 11 1 C

No change because all columns included zero


Step 3: Cover all zero in the matrix by lines:

)3( )2( ) 1( Machines


0 0 4 A
17 2 0 B
0 11 1 C

Number of lines = number of rows= number of


columns = 3 (optimal solution)
Step (4): Assign zero values in rows or columns
containing one zero:

Cost Order Machines


26 2 A
28 1 B
24 3 C
78 Total

Minimum cost = 78

You might also like