AGNES, Jessa A.

(201812296) MGT 181 Activity 7 December 13,2020

INSTRUCTIONS:
Give two examples of situations, outside the scope of business operations, where either the
transportation or assignment algorithm could be used. Discuss the objective—main purpose or
function of the algorithm to be used (what problem will it solve?); and the kinds of data that may
be used—independent variable, dependent variables, and controlled variables .

1. Transportation Problem:
Mr. Ayushiridara Amber, a certified online shopper wishes to surprise her triplet’s niece
this Christmas. His nieces are Jelou, Camille, and Mary Grace who are already in High school
level. Mr. Amber wants to give gifts to her nieces based on their personal interests and
personalities. For Jelou, he checks for different dresses since she loves wearing dresses to post it
to her Instagram account. On the other hand, Mr. Amber picks pieces of art materials for Camille
since she loves painting real-life events. Lastly, Mary Grace is a chess player in their school so
Mr. Amber picked a packaged item which is a chessboard and chess clock for her. Mr. Amber
wishes to ship these gifts to his nieces to three different shipping couriers, namely; NinjaVan, Grab
Express, and J&T express. The shipping costs for NinjaVan, Grab Express, and J&T Express are
shown in the table below. Formulate and solve a linear program to determine the shipping
arrangements for his three nieces that will minimize cost.

Destination
Courier Jelou Camille Mary Grace Supply
NinjaVan Php 100 Php 150 Php 300 10
Grab Php 110 Php 120 Php 250 10
Express
J&T Express Php 200 Php 130 Php 170 10
Demand 15 9 6 =30
Table 1
Define the Decision Variables

Destination
Courier Jelou Camille Mary Grace
NinjaVan X1 X2 X3
Grab Express X4 X5 X6
J&T Express X7 X9 X10
Table 1.1

Define the Objective Function

Minimize the total shipping cost.

Min: (shipping cost per item for each courier per destination) X (number of item/shipments
shipped by courier by courier per destination pairing)

Min: 100x1 + 150x2 + 300x3 +110x4 + 120x5 + 250x6 + 200x7 + 130x8 + 170x9

Solution:

Using North-West corner cell method:

Step 1:

Destination
Courier Jelou Camille Mary Grace Supply
NinjaVan Php 100 Php 150 Php 300 10
10 0
Grab Express Php 110 Php 120 Php 250 10
J&T Express Php 200 Php 130 Php 170 10
Demand 15 9 6 =30
5
Table 1.3

The highlighted cell reflects the northwest corner; thus, we should start with this cell. Each entry
of this cell is considered as a cost of shipment. The northwest corner cell (Php 100) will be
allocated a value of 10 since the demand is greater than supply (15≥10). Figure 10 will be canceled
and the demand will be deducted by 10 since the supply is 10. The supply 0 will lead to the
cancellation of its row, which will be highlighted to reflect the elimination
Step 2:
Destination
Courier Jelou Camille Mary Grace Supply
NinjaVan Php 100 Php 150 Php 300 10
10 0
Grab Express Php 110 Php 120 Php 250 10
5 5
J&T Express Php 200 Php 130 Php 170 10
Demand 15 9 6 =30
5
0
Table 1.4

The remaining cells will be selected for which cells will be used as a northwest corner. The
northwest corner cell for this step is Php 110 cost. It is shown that demand is lesser than supply,
so the demand of 5 will be zero while the supply is 5.

Step 3:
Destination
Courier Jelou Camille Mary Grace Supply
NinjaVan Php 100 Php 150 Php 300 10
10 0
Grab Express Php 110 Php 120 Php 250 10
5 5 5
0
J&T Express Php 200 Php 130 Php 170 10
Demand 15 9 6 =30
5 4
0
The chosen northwest corner cell is Php 120 cost. The demand is greater than supply having
9 ≥ 5.
Step 4:
Destination
Courier Jelou Camille Mary Grace Supply
NinjaVan Php 100 Php 150 Php 300 10
10 0
Grab Express Php 110 Php 120 Php 250 10
5 5 5
0
J&T Express Php 200 Php 130 Php 170 10
4 6
Demand 15 9 6 =30
5 4
0 0
Table 1.5
 The chosen northwest corner cell has Php 130 cost. The supply is greater than the demand
having 10 ≥ 4, thus the remaining supply after deducting 4 is 6.

Step 5:

Destination
Courier Jelou Camille Mary Grace Supply
NinjaVan Php 100 Php 150 Php 300 10
10 0
Grab Express Php 110 Php 120 Php 250 10
5 5 5
0
J&T Express Php 200 Php 130 Php 170 10
4 6 6
0
Demand 15 9 6 =30
5 4 0
0 0
Table 1.6

The last cell equals the demand to supply. Hence the cells are eliminated. Now, we will
multiply the value with the cell value.

= 100(10) + 110(5) + 120(5) + 130(4) + 170(6) = 3,690

NinjaVan= 100(10) = 1,000

Grab Express= 110(5) + 120(5) = 1,050

J&T Express= 130(4) + 170(6) = 1,540

Hence, Mr. Amber will be paying Php 3,960 for the shipment cost to the couriers of thirty
items for his nieces. He will be paying Php 1,000 for the items to NinjaVan, Php 1,050 to Grab
Express and Php 1,540 to J&T Express.
2. Assignment Problem:

Mrs. Yahub Wasabi, a full-time mother to her three adopted children, namely; Asahi,
Haruto, and Yoshi, is sixty-five years old already. One day, Mrs. Wasabi decided that she is tired
of doing household chores due to her aging issues, so she thinks that it would be better if her
children would do the work for her since they are at the right age to clean the house. But, she
cannot easily assign tasks to her children, and thus, she observed her three boys when doing
household chores if told. The problem revolves around assigning tasks to Asahi, Haruto, and
Yoshi; of who of them can work effectively and efficiently given a short of time. Given below are
the tasks and the names of children of Mrs. Wasabi including the time each of them does certain
tasks.

Names
Jobs Asahi Haruto Yoshi
Sweeping 15 minutes 10 minutes 30 minutes
Washing Clothes 90 minutes 100 minutes 110 minutes
Cooking 25 minutes 30 minutes 20 minutes
Table 2.1

Solution:

How should Mrs. Wasabi be assigned so that the total time is minimized?

Using Hungarian Method

Step 1:

Subtract the minimum value of each row from the elements of respective rows.

Names
Jobs Asahi Haruto Yoshi Minimum Row Value
Sweeping 15 minutes 10 minutes 30 minutes 10 minutes
Washing Clothes 90 minutes 100 minutes 110 minutes 90 minutes
Cooking 25 minutes 30 minutes 20 minutes 20 minutes
Figure 2.2
Resulting Figure:

Names
Jobs Asahi Haruto Yoshi
Sweeping 5 0 20
Washing Clothes 0 10 20
Cooking 5 10 0
Figure 2.3

Hence, we will not be proceeding to Step 2, where subtracting the minimum value of each
column from the elements of respective columns since it can be easily observed that each column
has a minimum value of zeros.

The optimum solution is:

Sweeping- Haruto (10 minutes)

Washing Clothes- Asahi (90 minutes)

Cooking- Yoshi (20 minutes)

Hence the total minimum time will be:

10 minutes + 90 minutes + 20 minutes = 120 minutes or 2 hours

Thus, it can be shown in the figures above that Haruto, Asahi, And Yoshi have certain tasks
they can easily finish at minimum time. Haruto can finish sweeping in 10 minutes, washing clothes
is a forte of Asahi, and Yoshi is good at cooking for 20 minutes. If they work together, then they
can consume two hours only which they can have plenty of time doing their hobbies.