Scribd
Upload
8 views4 pages

Adobe Scan 22-Apr-2022

The document discusses various optimization problems related to assignment and cost minimization. It includes examples of assigning operators to machines, cars to customers, and jobs to machines, with specific constraints and distance or cost matrices provided. The goal in each case is to find the optimal assignment that minimizes cost or distance.

Uploaded by

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

Adobe Scan 22-Apr-2022

The document discusses various optimization problems related to assignment and cost minimization. It includes examples of assigning operators to machines, cars to customers, and jobs to machines, with specific constraints and distance or cost matrices provided. The goal in each case is to find the optimal assignment that minimizes cost or distance.

Uploaded by

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

I, 2 III, 3 IV and the minimum cost is 4 -3.

Ex. 5. Consider the problem of assigning four I II IV


operators to four machines. The assignment costs
15 5 2
in rupees are given here. Operator 1 cannot be
2 7 2 3
assigned to machine I and operator 3 cannot
be assigned to machine IV. Find the optimal 3 9 3 5
cost of assignment.
4 7 2 6 7

[Vidyasagar Hons., 19891


ASSIgn tne programmers to t i e
prog [Kalyani Hons., 1988]
time is least.
LAng 1 C, 2 »
B, 3 A; Min. time = 280 minutes.]

1 5 A car hire company has one car at each of the five depots a, b, c, d and e.
A Customer in each of the five towns A, B a b C d e
C, D and E requires a car. The distance A 160 130 175 190 200
(in miles) between the depots (origins) and
the towns (destinations) where the customerss B 135 120 130 160 175
are, is given in the adjacent distance
C140 110 1225 170 185
matrix.
How should the cars be assigned to the D 50 50 80 80 110
Customers so as to minimize the distance E 55 35 80 80 105
travelled.
[Calcutta M. Sc., 1976
LPhs A» b, B » e, C » C, D a, E d; Min. dist.
miles.] = 560

A company has four machines on which to do three jobs. Each job can be
assigned to and only one machine. The cost
one
of each job on each machine is given in the
MACHINES
adjacent tableau. What are the job assignment
W X Y Z
which will minimize the cost? A 18 24 28 32

Add a fictitious row to balance the problem.j B 8 13 17 19


Ans A » W, B X, C - Y; C 10 15 19 22
or A W, B Y, C X; Min. Cost 50.] [Kalyani M. Sc., 1983
THEOR)Y 47
vii B
0
0 0 0 00
4 2 0 2 11
A 4 3 1 3 2 2
4 3 7-5 1 2
4 3 4-1 2 2
4 3 3-2 2 2
= 4.
[Jadavpur, 1985
245
[Jadavpur, 1S
B (iv)
B Ba
A 3
3 5 A
Az
-1 6
A As
A 4 1

2 2
As
As -5

[Kalyani, 1985; Calcutta Hons., 1984

You might also like