P = (P1 + P2)(P1 + P3)(P2 + P4)(P3 + P5 )(P4 + P6)(P5 + P6) = 1
using the Boolean algebra rule (X + Y)(X + Z) = X + YZ, as
well as the distributive law, the function below is as follows:
P = (P1 + P2P3)(P4 + P2P6)(P5 + P3P6)
= (P1P4 + P1P2P6 + P2P3P4 + P2P3P6)(P5 + P3P6)
= P 1P 4P 5 + P 1P 2P 5P 6 + P 2P 3P 4P 5 + P 2P 3P 5P 6 + P 1P 3P 4P 6 +
P 1P 2P 3P 6 + P 2P 3P 4P 6 + P 2P 3P 6
After this, using X + XY = X to remove redundant terms
from the logic function P, the following function is
produced:
P = P 1P 4P 5 + P 1P 2P 5P 6 + P 2P 3P 4P 5 + P 1P 3P 4P 6 + P 2P 3P 6
P = P 1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P5P6 + P1P3P4P6 + P1P2P3P6 + P2P3P4P6 + P2P3P6
using X + XY = X to remove redundant terms
P = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P5P6 + P2P3P6 + P1P3P4P6 + P1P2P3P6 + P2P3P4P6
P = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P6 + P1P3P4P6 + P1P2P3P6 + P2P3P4P6
P = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P6 + P1P3P4P6 + P1P2P3P6 + P2P3P4P6
P = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P6 + P1P3P4P6+ P2P3P4P6
P = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P6 + P1P3P4P6+ P2P3P4P6
P = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P6 + P1P3P4P6
P = P1P4P5 + P1P2P5P6 + P2P3P4P5 + P2P3P6 + P1P3P4P6
choose solutions with minimum number of literals : (P1P4P5 ) & P2P3P6
rows P1, P4, and P5 corresponds to F = a'b' + bc' + ac
Packages arrive at the stockroom and are delivered on carts to offices and laboratories
by student [Link] carts and packages are various sizes and [Link] students
are paid according to the carts [Link] are five carts and the pay for their use is
Cart C1: $2
Cart C2: $1
Cart C3: $4
Cart C4: $2
Cart C5: $2
On a particular day, seven packages arrive, and they can be delivered using the five
carts as follows:
C1 can be used for packages P1, P3, and P4.
C2 can be used for packages P2, P5, and P6.
C3 can be used for packages P1, P2, P5, P6, and P7.
C4 can be used for packages P3, P6, and P7.
C5 can be used for packages P2 and P4.
The stockroom manager wants the packages delivered at minimum cost. Using
minimization techniques described in this unit, present a systematic procedure for
finding the minimum cost solution.
Cart C1: $2
Cart C2: $1
Cart C3: $4
Cart C4: $2
Cart C5: $2
C1-- P1, P3, P4.
C2 --P2, P5, P6.
C3--P1, P2, P5, P6, P7.
C4-- P3, P6, P7.
C5 --P2 , P4.
C = ( C1 + C3) ( C2 + C3 + C5) ( C1 + C4) (C2 + C5) ( C2 + C3) (C2 + C3 + C4) (C3 + C4)
C = C1C2C3 + C1C2C4 + C1C3C5 + C2C3C4 + C3C4C5
C1C2C4
C = ( C1 + C3) ( C2 + C3 + C5) ( C1 + C4) (C2 + C5) ( C2 + C3) (C2 + C3 + C4) (C3 + C4)
C = ( C1 + C3) ( C2 + C3 + C5) ( C1 + C4) (C2 + C5) ( C2 + C3) (C2 + C3 + C4) (C3 + C4)
C = (C1 + C3C4) (C2 + C3 + C4C5) (C2+ C3C5) (C3 +C4)
MULTIPLY second and third term
C = (C1 + C3C4) [C2 +C2C3C5 + C2C3 + C3C5 + C2C4C5 + C3C4C5 ] (C3 + C4)
C = (C1 + C3C4) [C2 +C2C3C5 + C2C3 + C3C5 + C2C4C5 + C3C4C5 ] (C3 + C4)
1 2 1 2 (X + XY =X)
C = (C1 + C3C4) [C2 + C3C5 + C2C4C5 + C3C4C5 ] (C3 + C4)
1 1
C = (C1 + C3C4) [C2 + C3C5 + C2C4C5 ] (C3 + C4)
1 1
C = (C1 + C3C4) [ C2 + C3C5] (C3 + C4)
C = (C1 + C3C4) [ C2C3 +C2C4 + C3C5 + C3C4C5]
C = (C1 + C3C4) [C2C3 +C2C4 + C3C5]
C = (C1 + C3C4) [ C2 + C3C5] (C3 + C4) Cart C1: $2
Cart C2: $1
C = (C1 + C3C4) [ C2C3 +C2C4 + C3C5 + C3C4C5] Cart C3: $4
Cart C4: $2
C = (C1 + C3C4) [C2C3 +C2C4 + C3C5] Cart C5: $2
C = C1C2C3 + C1C2C4 + C1C3C5 + C2C3C4 + C2C3C4 + C3C4C5
1 1 X+X=X
C = C1C2C3 + C1C2C4 + C1C3C5 + C2C3C4 + C3C4C5
7 5 8 7 8 ------- COST INCURRED
C = C1C2C4
USING CART C1 C2 AND C4 MINIMUM COST IS 5
