Bachelor of Computer Applications and 4th semester

Optimization Techniques (BCAC403)

BCA
2023-2024

Study Material
Optimization Techniques
BCAC403
Module-4
_________________________________________________________________________________

Table of Contents

SL No. CONTENTS Page No.

1 4.1 Introduction 2
2 4.2 Model formulation 4
3 4.3 Hungarian Method 5
4 4.4 Special Cases 6
5 4.5 Solved Examples 7

6 4.6 Self-Assessment Questions 20

Department of Mathematics
Brainware University, Kolkata 1
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Module 4

4.1 Introduction

The Assignment Problem is a classical optimization problem in the field of Operations Research. It is
a special case of linear programming and is widely used in various real-life applications to efficiently
allocate resources or tasks to a group of agents or machines. The main objective of the assignment
problem is to find the most optimal assignment that minimizes or maximizes a given objective function
while satisfying certain constraints.

In a typical assignment problem, we have a set of agents (e.g., workers, machines) and a set of tasks
(e.g., jobs, projects) that need to be completed. Each agent is capable of performing a subset of the
tasks, and each task requires a specific amount of resources or effort to be completed by a particular
agent. The goal is to determine the best assignment of tasks to agents, such that the overall cost, time,
or any other objective measure is minimized or maximized.

Formally, the assignment problem can be represented as follows:

Introduction to Assignment Problem in Operations Research:

The Assignment Problem is a classical optimization problem in the field of Operations Research. It is
a special case of linear programming and is widely used in various real-life applications to efficiently
allocate resources or tasks to a group of agents or machines. The main objective of the assignment
problem is to find the most optimal assignment that minimizes or maximizes a given objective
function while satisfying certain constraints.

In a typical assignment problem, we have a set of agents (e.g., workers, machines) and a set of tasks
(e.g., jobs, projects) that need to be completed. Each agent is capable of performing a subset of the
tasks, and each task requires a specific amount of resources or effort to be completed by a particular
agent. The goal is to determine the best assignment of tasks to agents, such that the overall cost, time,
or any other objective measure is minimized or maximized.

Formally, the assignment problem can be represented as follows:

Department of Mathematics
Brainware University, Kolkata 2
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

1. Agents: Let there be 'n' agents (A1, A2, ..., An).

2. Tasks: Let there be 'm' tasks (T1, T2, ..., Tm).

3. Assignment Matrix: Create an 'n x m' matrix where each element 'cij' represents the cost,
time, or any other measure associated with assigning the task 'Tj' to the agent 'Ai'.

4. Constraints: Each task can be assigned to exactly one agent, and each agent can be assigned
to at most one task.

The objective is to find an assignment that minimizes or maximizes the total cost, time, or any other
objective function, subject to the constraints mentioned above.

There are various methods to solve the assignment problem, and these methods often leverage
algorithms like the Hungarian algorithm, the shortest path algorithm, or other optimization
techniques to find the optimal assignment efficiently. The Hungarian algorithm, in particular, is a
well-known algorithm that efficiently solves the assignment problem in polynomial time.

Applications of the assignment problem can be found in diverse fields such as workforce
management, transportation planning, project scheduling, and resource allocation. Whether it's
assigning workers to specific tasks, machines to manufacturing jobs, or optimizing the efficiency of a
transportation network, the assignment problem plays a crucial role in streamlining operations and
improving overall productivity.

In summary, the assignment problem in Operations Research is a valuable tool for optimizing the
allocation of resources, tasks, or jobs to agents, and it has broad applications in various industries
and real-world scenarios. By efficiently finding the optimal assignment, businesses and organizations
can minimize costs, maximize productivity, and make well-informed decisions in their daily
operations.

Assumptions:

1. Number of jobs is equal to the number of machines or persons.

2. Each man or machine is assigned to only one job.
3. Each man or machine is independently capable of handling any job to be done.
4. Assigning criteria is clearly specified (minimizing cost or maximizing profit)

Department of Mathematics
Brainware University, Kolkata 3
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

4.2 Model formulation:

Consider a problem of assignment of n resources (workers) to n activities(jobs) so as to minimize the

overall cost or time in such a way that each resource can associate with one and only one activity.
The cost (or effectiveness) matrix 𝐶𝑖𝑗 is given as under:

Activity Available
𝐴1 𝐴2 … 𝐴𝑛 1
𝑅1 𝑐11 𝑐12 … 𝑐1𝑛 1
𝑅2 𝑐21 𝑐22 … 𝑐2𝑛
Resource

𝑅𝑛 𝑐𝑛1 𝑐𝑛2 … 𝑐𝑛𝑛 1

Required 1 1 … 1

The cost matrix is same as that of a transportation problem except the availability at each of the
resources and the requirement at each of the destinations is unity (due to the fact that assignments are
made on a one-one basis).

Let 𝑥𝑖𝑗 denote the assignment of i-th resource to j-th activity, such that

1 , if resource i is assigned to activity j

𝑥𝑖𝑗 = {
0, otherwise

Then, the model formulation of Assignment Problem is:

𝑛 𝑛

𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = ∑ ∑ 𝑐𝑖𝑗 𝑥𝑖𝑗

𝑖=1 𝑗=1

Subject to the following constraints:

∑𝑛𝑗=1 𝑥𝑖𝑗 = 1 for all i (resource availability)

∑𝑛𝑖=1 𝑥𝑖𝑗 = 1 for all j (activity requirement)

𝑥𝑖𝑗 = 0 𝑎𝑛𝑑 1 (i=1, 2, …, n and j=1,2, …n)

Department of Mathematics
Brainware University, Kolkata 4
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

And where 𝑐𝑖𝑗 is the cost associated with assigning i-th resource of j-th activity.

4.3 Hungarian Method:

The Hungarian Method is an efficient algorithm for solving the Assignment Problem and finding the
optimal assignment of tasks to agents with minimum cost. The algorithm was developed by two
Hungarian mathematicians, Dénes Kőnig and Jenő Egerváry, and later independently rediscovered
and popularized by Harold Kuhn in the 1950s. The Hungarian Method is based on the principles of
linear programming and uses the concept of augmenting paths to iteratively find the optimal
assignment.

Here's a step-by-step guide to the Hungarian Method for solving the Assignment Problem:

Step 1: Create the Cost Matrix Given the assignment problem with 'n' agents and 'm' tasks, create an
'n x m' matrix representing the cost of assigning each task to each agent. If the problem involves
maximizing a measure (e.g., profit), convert it to a minimization problem by subtracting each value
from the maximum value in the matrix.

Step 2: Row Reduction In this step, reduce each row of the cost matrix such that each row contains at
least one zero. This is done by subtracting the smallest element in each row from all the elements in
that row.

Step 3: Column Reduction Next, reduce each column of the cost matrix in a similar manner. Subtract
the smallest element in each column from all the elements in that column.

Step 4: Marking the Zeros and Drawing Lines Identify the minimum number of lines (horizontal and
vertical) needed to cover all the zeros in the reduced matrix. If the number of lines is equal to 'n', an
optimal assignment is possible. Proceed to Step 5. If not, go to Step 6.

Step 5: Optimal Assignment Found (or Improve the Solution) If the number of lines drawn is equal
to 'n', an optimal assignment is possible. Assign tasks to agents such that each task has exactly one
assigned agent. If there are multiple assignments possible, any optimal assignment can be chosen.
The total cost of the assignment represents the minimum cost for the problem.

Step 6: Modify the Matrix and Repeat If the number of lines drawn is less than 'n', modify the cost
matrix to create more zeros without violating the line covering constraint. This involves two possible
cases:

Department of Mathematics
Brainware University, Kolkata 5
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

6a. Create additional zeros: Find the smallest element 'min' not covered by any line. Subtract 'min'
from all uncovered elements and add 'min' to the elements at the intersection of two lines.

6b. Create a zero and delete another: Find the minimum value 'min' of the uncovered elements.
Subtract 'min' from all uncovered elements and add 'min' to the elements at the intersection of two
lines.

After modification, return to Step 4 and repeat the process until an optimal assignment is found.

Step 7: Obtain the Optimal Assignment Once an optimal assignment is achieved (Step 5), the
assignment of tasks to agents represents the optimal solution to the Assignment Problem, with the
minimum total cost or maximum measure achieved.

The Hungarian Method is guaranteed to find the optimal solution to the Assignment Problem in
polynomial time, making it highly efficient even for large-scale problems. It is widely used in
various industries and applications, such as project scheduling, resource allocation, and workforce
management, where optimal task assignment is critical for minimizing costs and maximizing
efficiency.

4.4 Special Cases

1. Maximization Problem:

The elements of cost matrix of the assignment problem represent profits instead of costs and the
corresponding cost matrix is called profit matrix. To solve this problem first, the largest element of
the profit matrix is selected. Then we subtract all elements from the largest element to get new cost
matrix which will provide the maximum profit of the original problem.

2. Unbalanced Assignment:

If the number of jobs is not equal to the number of workers or machines, then the problem is
unbalanced. In this case we add a fictitious job or machine with zero cost. Then we apply the
assignment algorithm to the resulting balanced problem.

3. Impossible Assignment:

If some job cannot be assigned by some particular worker, then we avoid this effectively by putting a
large cost in that cell.

Department of Mathematics
Brainware University, Kolkata 6
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

4. Negative cost:

If the cost matrix contains some negative cost, then we add to each element a quantity to make all
elements non-negative.

4.5 Solved Examples

Department of Mathematics
Brainware University, Kolkata 7
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Iteration-1 of steps 3 to 6

Step-3: Make assignment in the opporunity cost table

(1) Row wise cell (A, 2) is assigned

(2) Row wise cell (D, 1) is assigned, so column wise cell (B, 1) crossed off.

(3) Row wise cell (B, 4) is assigned, so column wise cell (C, 4), (E, 4) crossed off.

(4) Column wise cell (C, 3) is assigned, so row wise cell (C, 5) crossed off.

Department of Mathematics
Brainware University, Kolkata 8
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Step-4: Number of assignments = 4, number of rows = 5 Which is not equal, so solution is not
optimal.

Step-5: Draw a set of horizontal and vertical lines to cover all the 0

Step-5: Cover the 0 with minimum number of lines

(1) Mark(√) row E since it has no assignment

(2) Mark(✔) column 4 since row E has 0 in this column

(3) Mark(√) row B since column 4 has an assignment in this row B.

(4) Mark(✔) column 1 since row B has 0 in this column

(5) Mark(√) row D since column 1 has an assignment in this row D.

(6) Since no other rows or columns can be marked, therefore draw straight lines through the
unmarked rows A, C and marked columns 1,4

Department of Mathematics
Brainware University, Kolkata 9
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Step-6: Develop the new revised table by selecting the smallest element, among the cells not covered

by any line (say k = 3)

Subtract k = 3 from every element in the cell not covered by a line.

Add k = 3 to every element in the intersection cell of two lines.

Repeat steps 3 to 6 until an optimal solution is obtained.

Iteration: 1

Iteration-2 of steps 3 to 6

Department of Mathematics
Brainware University, Kolkata 10
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Step-3: Make assignment in the opporunity cost table

(1) Row wise cell (A, 2) is assigned

(2) Column wise cell (C, 5) is assigned, so row wise cell (C, 3) crossed off.

(3) Row wise cell (B, 1) is assigned, so column wise cell (D, 1) crossed off., so row wise cell (B, 4)
crossed off.

(4) Row wise cell (D, 3) is assigned, so column wise cell (E, 3) crossed off.

(5) Row wise cell (E, 4) is assigned

Department of Mathematics
Brainware University, Kolkata 11
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Ex: A car hire company has one car at each of five depots a,b,c,d and e. A customer in each of five
towns A, B, C, D and E requires a car. The distance (in kms.) between the depots (origins) and the
towns (destinations), where the customers are, is given in the following distance matrix:

a b c d e
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105

Department of Mathematics
Brainware University, Kolkata 12
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

How should the cars be assigned to customers so as to minimize the distance travelled?

Department of Mathematics
Brainware University, Kolkata 13
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Iteration-1 of steps 3 to 6

Step-3: Make assignment in the opporunity cost table

(1) Row wise cell (A, 2) is assigned, so column wise cell (B, 2), (C, 2), (D, 2), (E, 2) crossed off.

(2) Column wise cell (D, 1) is assigned, so row wise cell (D, 4) crossed off.

(3) Column wise cell (B, 3) is assigned, so row wise cell (B, 5) crossed off.

Row wise & column wise assignment shown in table

Department of Mathematics
Brainware University, Kolkata 14
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Step-4: Number of assignments = 3, number of rows = 5 Which is not equal, so solution is not
optimal.

Step-5: Cover the 0 with minimum number of lines

(1) Mark(✔) row C since it has no assignment

(2) Mark(✔) row E since it has no assignment

(3) Mark(√) column 2 since row C has 0 in this column

(4) Mark(√) row. since column 2 has an assignment in this row...

(5) Since no other rows or columns can be marked, therefore draw straight lines through the
unmarked rows B, D and marked columns 2

Department of Mathematics
Brainware University, Kolkata 15
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Step-6: Develop the new revised table by selecting the smallest element, among the cells not covered

by any line (say k = 15)

Subtract k = 15 from every element in the cell not covered by a line.

Add k = 15 to every element in the intersection cell of two lines.

Repeat steps 3 to 6 until an optimal solution is obtained.

Iteration: 1

Iteration-2 of steps 3 to 6

Step-3: Make assignment in the opporunity cost table

(1) Row wise cell (C, 2) is assigned, so column wise cell (1, 2),(E, 2) crossed off.

(2) Row wise cell (4, 5) is assigned, so column wise cell (B, 5),(E, 5) crossed off.

(3) Row wise cell (B, 3) is assigned

(4) Row wise cell (E, 4) is assigned, so column wise cell (D, 4) crossed off.

(5) Row wise cell (D, 1) is assigned

Repeat steps 3 to 6 until an optimal solution is obtained.

Department of Mathematics
Brainware University, Kolkata 16
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Department of Mathematics
Brainware University, Kolkata 17
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Exercise: A company is producing a single product and selling it through five agencies situated in
different cities. All of a sudden, there is a demand forthe product in five more cities that do not have
any agency of the company.

The company is faced with the problem of deciding on how to assign the existing agencies to
dispatch the product to the additional cities in such a waythat the travelling distance is minimised.
The distances (in km) between the surplus and deficit cities are given in the following distance
matrix.

Deficit City I II III IV V

Surplus city

A 160 130 175 190 200

B 135 120 130 160 175

C 140 110 155 170 185

D 50 50 80 80 110

E 55 35 70 80 105

Determine the optimum assignment schedule.

Distinguish between Transportation Problem and Assignment Problem

Department of Mathematics
Brainware University, Kolkata 18
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Transportation Problem Assignment Problem

1. Transportation Problem is a special type of 1. Assignment Problem is a special type of TP
LPP.
2. The quantity 𝑥𝑖𝑗 to be transported from i-th 2. Here j-th job is to be assigned to the i-th
origin to j-th destination can take any positive person and 𝑥𝑖𝑗 can take either 1 or 0
value.
3.Number of sources and number of 3. Since assignment is one-one correspondence,
destinations need not be equal, i.e. cost matrix hence number of source and number of
need not be square. destinations are equal, i.e. cost matrix must be
square.
4.The capacity and requirement value are equal 4. The capacity and requirement value are equal
to 𝑎𝑖 and 𝑏𝑗 to 1.
5. Mathematical form 1. Mathematical form

𝑛 𝑚 𝑛 𝑛

𝑀𝑖𝑛 𝑍 = ∑ ∑ 𝑐𝑖𝑗 𝑥𝑖𝑗 𝑀𝑖𝑛 𝑍 = ∑ ∑ 𝑐𝑖𝑗 𝑥𝑖𝑗

𝑖=1 𝑗=1 𝑖=1 𝑗=1

Where ∑𝑛𝑗=1 𝑥𝑖𝑗 = 𝑎𝑖 and ∑𝑚

𝑖=1 𝑥𝑖𝑗 = 𝑏𝑗 Where ∑𝑛𝑗=1 𝑥𝑖𝑗 = 1 and ∑𝑛𝑖=1 𝑥𝑖𝑗 = 1

𝑥𝑖𝑗 ≥ 0 𝑥𝑖𝑗 ≥ 0

Department of Mathematics
Brainware University, Kolkata 19
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

4.6 Self-Assessment Questions

Group –A

(Multiple Choice Type Question)

Calculate the maximum profit for the following 3 x 3 assignment

problem.

1 1 4
6 7 2
8 4 3
1

a. 15 b. 18

c. 19 d. 23

Consider the following balanced TP with 2 supplies and 3 destinations.

The solution is found using NWC rule. Calculate the cost.

5 6 3 50
7 5 8 40
2
30 25 35
a. 570 b. 575

c. 580 d. 595

If ui and vj represent the dual variables in the assignment formulation,

3 then justify constraint set.

a. ui + vj = Cij b. ui + vj ≥ Cij

c. ui + vj ≤ Cij d. None of these

Dealing with assignment problems, we are assigning people to activities

4 based on the cost, explain the usage of Hungarian Algorithm.

a. To minimize cost b. To maximize cost

Department of Mathematics
Brainware University, Kolkata 20
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

c. To assign all of the d. To find more people that

activities to just one person we can assign activities to
Calculate the no. of variables does the formulation of 5 x 5 assignment
5 problem have.

a. 20 b. 25

c. 30 d. 35

Evaluate the number of constraints does a 5 x 5 assignment problem

6 have.

a. 8 b. 10

c. 12 d. 15

Calculate the number of variables does the dual of 5 x 5 assignment

7 problem have.

a. 9 b. 10

c. 11 d. 12

Calculate the number of constraints does the dual of the 5 x 5

8 assignment problem have.

a. 15 b. 20

c. 25 d. 30

Evaluate the minimum cost for the following 3 x 3 assignment problem.

1 1 4
6 7 2
8 4 3
9

a. 6 b. 7

c. 8 d. 9

Department of Mathematics
Brainware University, Kolkata 21
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

10 Choose the wrong option of Hungarian Method.

a. Subtract row minimum b. Subtract column minimum

from every row from every column
c. Draw lines through ticked d. Tick unassigned rows
rows and unticked columns
11 Select the wrong options about the Assignment problem:

a. It is a transportation b. The LP formulation will

problem give binary solutions
c. When solving, the cost d. LP can give non integer
matrix is square solution sometimes
In a 4 x 4 assignment problem where 4 jobs are assigned to 4 machines,
job 1 is Assigned to M2, job 2 to M4, Job 3 to M3. Select the fourth
12
assignment?
a. Job 4 to M2 b. Job 4 to M1

c. Job 4 to M3 d. Job 4 to M4

Consider the assignment problem with 4 jobs and 3 machines. Choose

the job that is not assigned to any machine.

1 1 4
6 7 2
8 4 3
5 6 7
13

a. Job 1 b. Job 2

c. Job 3 d. Job 4

Given the 4 x 4 maximization assignment problem. Select the maximum

profit.
14
1 1 4 8

Department of Mathematics
Brainware University, Kolkata 22
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

6 7 2 7
8 4 3 6
5 6 7 8
a. 20 b. 30

c. 32 d. 40

15

Choose the machine that does not get a job in the optimum
15 assignment.

a. 1 b. 2

c. 3 d. 4

16 Evaluate the objective function value at the optimum.

a. 9 b. 10

c. 11 d. 12

Select the correct option. Consider the following assignment problem. If

you solve it by hand, the number of assignments that you get in the first
iterations is ____.

20 17 22 16
32 29 33 26
26 27 29 28
40 30 35 37
17

a. 2 b. 3

c. 4 d. 5

Department of Mathematics
Brainware University, Kolkata 23
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Group – B

1 Evaluate the maximum profit for the following 4x 3 assignment problem

1 1 4
10 7 2
5 4 6
6 3 7
2 Illustrate the maximum profit for the following 4x 3 assignment problem

7 7 4
2 1 6
0 4 5
2 5 1
3 Explain mathematical form of Assignment Problem.
4 Consider the following assignment problem. When you solve it by hand, estimate the
number of assignments that you get in the first iterations.

20 17 22 16
32 29 33 26
26 27 29 28
40 30 35 37
5 Explain different types of Assignment Problem.

Group – C

1 Consider the problem of assigning four operators to four machines. The assignment
cost in rupees are given below. Operator 1 cannot be assigned to machine 3 and
operator 3 cannot be assigned to the machine 4. Calculate the optimal cost of
assignment.
Machine
1 2 3 4
1 5 5 - 2
2 7 4 2 3
Operator
3 9 3 5 -
4 6 2 6 7

Department of Mathematics
Brainware University, Kolkata 24
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

2 Consider the following assignment problem, Determine the solution of it.

1 2 3 4 5
A 6 5 8 11 16
B 1 13 16 1 10
C 16 11 8 8 8
D 9 14 12 10 16
E 10 13 11 8 16
3 Illustrate the minimum cost solution for the assignment problem whose cost coefficients
are as follows:
1 2 3 4 5
1 -2 -4 0 -6 -1
2 0 -9 -5 -5 -4
3 -3 -8 -9 -2 -6
4 -4 -3 -1 0 -3
5 -9 -5 -8 -9 -5
4 Illustrate the minimum cost for the following 5x 5 assignment problem.
1 1 4 3 2
10 7 8 6 7
8 4 6 3 9
6 6 7 8 9
12 10 11 13 12

Department of Mathematics
Brainware University, Kolkata 25
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

5 A car hire company has one car at each of five depots a, b, c, d, e. A customer in each
of five towns A, B, C, D, E requires a car. The distance (in kms.) between the
depots(origins) and the towns(destinations), where the customer are, is given in the
following distance matrix:
a b c d e
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105
Predict the assignment of cars to customers would minimize the distance traveled.
6 Estimate the optimum assignments and minimum time for the following Assignment
Problem.
SUBORDINATE I II III
TASK I 9 26 15
II 13 27 6
III 35 20 15
IV 18 30 20

7 The Head of the department has five jobs A, B, C, D, E and five sub-ordinates V, W,
X, Y, and Z. The number of hours each sub-ordinates would take to perform each job
is as follows:

V W X Y Z
A 3 5 10 15 8
B 4 7 15 18 8
C 8 12 20 20 12
D 5 5 8 10 6
E 10 10 15 25 10

Estimate all the jobs be allocated to minimize the total time.

8 Estimate the solution of the Assignment Problem given below for minimum cost.
A B C D
M1 18 26 17 11
M2 13 28 14 26
M3 38 19 18 15
M4 19 26 24 10

Department of Mathematics
Brainware University, Kolkata 26
Bachelor of Computer Applications and 4th semester
Optimization Techniques (BCAC403)
BCA
2023-2024

Department of Mathematics
Brainware University, Kolkata 27