‫‪Al Anbar University‬‬ ‫‪Mr. Ahmed A.

Al Hity‬‬

‫‪Example1 :‬‬
‫‪U‬‬ ‫ﺣﻞ ﻣﺴﺎﻟﺔ اﻟﺘﺨﺼﻴﺺ اﻟﺘﺎﻟﻴﺔ‬ ‫‪U‬‬

‫‪(minimize).‬‬

‫‪From‬‬ ‫‪1‬‬ ‫‪2‬‬ ‫‪3‬‬ ‫‪4‬‬ ‫‪5‬‬ ‫‪Si‬‬‫‪B‬‬ ‫‪B‬‬

‫‪1‬‬ ‫‪2‬‬ ‫‪3‬‬ ‫‪5‬‬ ‫‪1‬‬ ‫‪4‬‬ ‫‪1‬‬

‫‪2‬‬ ‫‪1‬‬ ‫‪3‬‬ ‫‪5‬‬ ‫‪8‬‬ ‫‪4‬‬ ‫‪1‬‬
‫‪3‬‬ ‫‪1‬‬ ‫‪7‬‬ ‫‪6‬‬ ‫‪8‬‬ ‫‪3‬‬ ‫‪1‬‬
‫‪4‬‬ ‫‪1‬‬ ‫‪3‬‬ ‫‪6‬‬ ‫‪1‬‬ ‫‪4‬‬ ‫‪1‬‬
‫‪5‬‬ ‫‪7‬‬ ‫‪3‬‬ ‫‪2‬‬ ‫‪1‬‬ ‫‪2‬‬ ‫‪1‬‬
‫)‪dj(To‬‬
‫‪B‬‬ ‫‪B‬‬ ‫‪1‬‬ ‫‪1‬‬ ‫‪1‬‬ ‫‪1‬‬ ‫‪1‬‬ ‫‪5‬‬

‫‪1‬‬ ‫‪2‬‬ ‫‪4‬‬ ‫‪0‬‬ ‫‪3‬‬

‫‪0‬‬ ‫‪2‬‬ ‫‪4‬‬ ‫‪7‬‬ ‫‪3‬‬
‫‪0‬‬ ‫‪6‬‬ ‫‪5‬‬ ‫‪7‬‬ ‫‪2‬‬
‫‪0‬‬ ‫‪2‬‬ ‫‪3‬‬ ‫‪0‬‬ ‫‪3‬‬
‫‪6‬‬ ‫‪0‬‬ ‫‪1‬‬ ‫‪0‬‬ ‫‪1‬‬

‫‪ -1‬ﻣﻦ آﻞ ﺳﻄﺮ ﻧﻄﺮح اﻗﻞ رﻗﻢ ﻣﻦ ﺑﻘﻴﺔ ﻋﻨﺎﺻﺮ اﻟﺴﻄﺮ‬

‫‪1‬‬ ‫‪2‬‬ ‫‪3‬‬ ‫‪0‬‬ ‫‪2‬‬

‫‪Number of‬‬
‫‪0‬‬ ‫‪2‬‬ ‫‪3‬‬ ‫‪7‬‬ ‫‪2‬‬
‫≠ ‪lines 3‬‬
‫‪0‬‬ ‫‪6‬‬ ‫‪4‬‬ ‫‪7‬‬ ‫‪1‬‬
‫)‪m(=5‬‬
‫‪0‬‬ ‫‪2‬‬ ‫‪2‬‬ ‫‪0‬‬ ‫‪2‬‬
‫‪6‬‬ ‫‪0‬‬ ‫‪0‬‬ ‫‪0‬‬ ‫‪0‬‬
‫‪ -2‬ﺗﻌﺎد ﻧﻔﺲ اﻟﻌﻤﻠﻴﺔ )‪ (1‬ﻋﻠﻰ اﻷﻋﻤﺪة‬
‫‪ -3‬ﻧﻐﻄﻲ اﻷﺻﻔﺎر اﻟﻤﻮﺟﻮدة ﺟﻤﻴﻌﻬﺎ ﺑﺄﻗﻞ ﻋﺪد ﻣﻦ اﻟﺨﻄﻮط اﻟﻌﻤﻮدﻳﺔ واﻷﻓﻘﻴﺔ وإذا‬
‫آﺎن ﻋﺪد اﻟﺨﻄﻮط = ‪ Optimal ← m‬وإذا ﻟﻢ ﻳﺘﺤﻘﻖ اﻟﺸﺮط ﻧﺴﺘﻤﺮ ﺑﺎﻟﺤﻞ‪.‬‬

‫‪1‬‬ ‫‪1‬‬ ‫‪2‬‬ ‫‪0‬‬ ‫‪1‬‬

‫‪Number of‬‬
‫‪0‬‬ ‫‪1‬‬ ‫‪2‬‬ ‫‪7‬‬ ‫‪1‬‬
‫≠ ‪lines 4‬‬
‫‪0‬‬ ‫‪5‬‬ ‫‪3‬‬ ‫‪7‬‬ ‫‪0‬‬ ‫)‪m(=5‬‬
‫‪0‬‬ ‫‪1‬‬ ‫‪1‬‬ ‫‪0‬‬ ‫‪2‬‬
‫‪7‬‬ ‫‪0‬‬ ‫‪0‬‬ ‫‪1‬‬ ‫‪0‬‬

‫‪ -4‬ﺗﺎﺑﻊ ﻟﻠﻤﺼﻔﻮﻓﺔ اﻟﺴﺎﺑﻘﺔ‬

‫ﻧﺒﺤﺚ ﻋﻦ اﺻﻐﺮ رﻗﻢ ﻣﻮﺟﻮد ﻓﻲ اﻟﻤﺼﻔﻮﻓﺔ ﺿﻤﻦ اﻟﻌﻨﺎﺻﺮ ﻏﻴﺮ اﻟﻤﻐﻄﺎة‬
‫وﻧﻄﺮﺣﻪ ﻣﻦ هﺬﻩ اﻟﻌﻨﺎﺻﺮ وﻧﻀﻴﻔﻪ إﻟﻰ ﻧﻘﺎط اﻟﺘﻘﺎﻃﻊ‪.‬‬
‫‪1‬‬
Al Anbar University Mr. Ahmed A. Al Hity

1 0 1 0 1
0 0 1 7 1
Number of
0 4 2 7 0
lines 5 =
0 0 0 0 1 m(=5)
8 0 0 2 1

‫ اﺻﻔﺎر ﺑﺤﻴﺚ ﻻ ﺗﻜﻮن ﻋﻠﻰ ﻧﻔﺲ اﻟﺴﻄﺮ أو اﻟﻌﻤﻮد وﻧﻤﺮر ﺧﻼﻟﻬﺎ‬5 ‫ ﻧﺨﺘﺎر‬-5
.‫اﻟﻜﻤﻴﺔ اﻟﻤﻄﻠﻮﺑﺔ‬

1 0
U U 1 0 1
0
U U 0 1 7 1
0 4 2 7 0
U U

0 0 0 0
U U 1
8 0 0
U U 2 1

X12 = X21= X35 = X44 = X53 = 1

B B B B B B B B B B

Min Z = 3 - 1 + 0 + 1 + 2 = 5

Example2: Solve the following problem (Minimize)

U U

12 10 15 22 18 8
10 18 25 15 16 12 Must be
11 19 3 8 5 9 Σ d = Σ S
5 14 10 13 13 12
8 12 11 7 13 10

12 10 15 22 18 8
10 18 25 15 16 12
11 19 3 8 5 9
5 14 10 13 13 12
8 12 11 7 13 10
0 0 0 0 0 0 Dummy
l

2
Al Anbar University Mr. Ahmed A. Al Hity

4 2 7 14 10 0
0 8 15 5 6 2
8 16 0 5 2 6 Number of
0 9 5 8 8 7 lines 5 ≠
m(=6)
1 5 4 0 6 3
0 0 0 0 0 0
‫أو‬

4 0 7 14 8 0
0 6 15 5 4 2
8 14 0 5 0 6 Number of
0 7 5 8 6 7 lines 5 ≠
m(=6)
1 3 4 0 4 3
2 0 2 2 0 2

6 0
U U 7 14 8 0
0 4 13 3 2 0
U U

10 14 0
U U 5 0 6 Number of
0
U U 5 3 6 4 5 lines 6 =
m(=6)
3 3 4 0 U U 4 3
4 0 2 2 0
U U 2

X12 = X26= X33 = X41 = X54 = X65 =1

B B B B B B B B B B B B

Min Z = 10 + 12 + 3 + 5 + 7 + 0 = 37

Example3: Solve the following maximization assignment problem

U U

16 10 14 11
14 11 15 15
15 15 13 12
13 12 14 15

3
Al Anbar University Mr. Ahmed A. Al Hity

16 10 14 11
14 11 15 15
15 15 13 12
13 12 14 15

‫ ﻓﻨﻄﺮح ﺟﻤﻴﻊ ﻋﻨﺎﺻﺮ اﻟﻤﺼﻔﻮﻓﺔ ﻣﻦ اآﺒﺮ ﻋﻨﺼﺮ‬maximization ‫ﻻن اﻟﻤﺴﺎﻟﺔ‬

‫ﻣﻮﺟﻮد‬

0 6 2 5
2 5 1 1
1 1 3 4
3 4 2 1

Min ‫اﻟﺨﻄﻮات اﻷﺧﺮى آﻤﺎ ﻓﻲ ﺣﺎﻟﺔ‬

0
U U 6 2 5 Number of
1 4 0
U U 0 lines 4 =
0 0
U U 2 3 m(=4)
2 3 1 0
U U

X11 = X23= X32 = X44 =1

B B B B B B B B

Min Z = 16 + 15 + 15 + 15 = 61