Scribd
Upload
50 views4 pages

Assignment Problem (Minimization) : EXERCISE NO:09 (B)

This document describes an assignment problem to minimize the overall cost of assigning 5 jobs (A, B, C, D, E) to 5 machines (1, 2, 3, 4, 5). It provides the costs for each job on each machine. The algorithm involves using a linear programming module to solve the assignment problem and determine which job is assigned to which machine to minimize total cost. The solution assigns jobs C, B, E, and D to machines 3, 2, 4, and 5 respectively, with a total minimum cost of $42.

Uploaded by

Parthiba Sakthivel
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
50 views4 pages

Assignment Problem (Minimization) : EXERCISE NO:09 (B)

This document describes an assignment problem to minimize the overall cost of assigning 5 jobs (A, B, C, D, E) to 5 machines (1, 2, 3, 4, 5). It provides the costs for each job on each machine. The algorithm involves using a linear programming module to solve the assignment problem and determine which job is assigned to which machine to minimize total cost. The solution assigns jobs C, B, E, and D to machines 3, 2, 4, and 5 respectively, with a total minimum cost of $42.

Uploaded by

Parthiba Sakthivel
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

EXERCISE NO:09(b)

ASSIGNMENT PROBLEM
(Minimization)
Do the assignment for the following problem so that to minimize the overall cost of doing the jobs by
different machines.

JOBS

MACHINES

A
B
C
D
E

13
9
12
6
15

8
15
9
12
17

16
24
4
10
18

18
9
4
8
12

19
12
4
13
20

ALGORITHAM:
STEP 1: Invoke POM application
STEP 2: Select module
STEP 3: Select LP: Assignment
STEP 4: Go to input screen
STEP 5: Give the problem title
STEP 6: Give how many objects to be assigned and select minimize problem
STEP 7: Go to solve menu .

RESULT:
Assignment problem is solved and viewed .

INPUT VIEW:

OUTPUT VIEW:

*** LINEAR PROGRAMMING ***


==========================================================================
PROBLEM NAME: Assignment
==========================================================================
Min Z= 13 X1 + 8 X2 + 16 X3 + 18 X4 + 19 X5 + 9 X6 + 15 X7 + 24 X8
+ 9 X9 + 12 X10 + 12 X11 + 9 X12 + 4 X13 + 4 X14 + 4 X15 + 6 X16
+ 12 X17 + 10 X18 + 8 X19 + 13 X20 + 15 X21 + 17 X22 + 18 X23
+ 12 X24 + 20 X25
ST
(1)
1 X1 + 1 X2 + 1 X3 + 1 X4 + 1 X5 = 1
(2)
1 X6 + 1 X7 + 1 X8 + 1 X9 + 1 X10 = 1
(3)
1 X11 + 1 X12 + 1 X13 + 1 X14 + 1 X15 = 1
(4)
1 X16 + 1 X17 + 1 X18 + 1 X19 + 1 X20 = 1
(5)
1 X21 + 1 X22 + 1 X23 + 1 X24 + 1 X25 = 1
(6)
1 X1 + 1 X6 + 1 X11 + 1 X16 + 1 X21 = 1
(7)
1 X2 + 1 X7 + 1 X12 + 1 X17 + 1 X22 = 1
(8)
1 X3 + 1 X8 + 1 X13 + 1 X18 + 1 X23 = 1
(9)
1 X4 + 1 X9 + 1 X14 + 1 X19 + 1 X24 = 1
(10)
1 X5 + 1 X10 + 1 X15 + 1 X20 + 1 X25 = 1
==========================================================================
SOLUTION:
==========================================================================
ITERATION NUMBER 21
VARIABLE MIX
-----------X24
X2
X13
X15
X10
X6
X1
X16
X21
Artificial 10
Z

SOLUTION
-------1.000
1.000
1.000
0.000
1.000
0.000
0.000
1.000
0.000
0.000
42.000

Assignment Problem Solution


Object1
Object2
Object3
Object4
Object5

Dest1
0
0
0
1
0

Dest2
1
0
0
0
0

Total cost or profit is

Dest3
0
0
1
0
0

Dest4
0
0
0
0
1

Dest5
0
1
0
0
0

$ 42

==========================================================================
SENSITIVITY ANALYSIS:
==========================================================================
CONSTRAINTS:
-------------------------------------------------------------------------RANGE OF RHS
CONSTRAINT
TYPE OF
SHADOW
FOR WHICH SHADOW
NUMBER
CONSTRAINT
PRICE
PRICE IS VALID
---------- -----------------------------NOTE: RHS shadow prices are not meaningful
for an assignment problem.
-------------------------------------------------------------------------DECISION VARIABLES:
-------------------------------------------------------------------------NONBASIC
AMOUNT Z IS REDUCED (MAX) OR INCREASED (MIN)
VARIABLE
FOR ONE UNIT OF X IN THE SOLUTION
--------------------------------------------------NOTE: Here are nonbasic variables with zero shadow
prices. Other shadow price values are of
questionable value in assignment problems.
X3
0.
X23
0.
--------------------------------------------------------------------------

You might also like