Five different machines can do any of the five required jobs, and the profits resulting from each assignment are given below. Jobs 1 2 3 4 5 Machines B C D E 37 40 28 40 24 27 21 36 33 30 35 40 36 36 39 A 30 40 40 32 25 38 29 62 41 34 Find the maximum profit possible through optimal assignment.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter5: Network Models
Section5.5: Shortest Path Models
Problem 31P
icon
Related questions
Question
Question 1
Five different machines can do any of the five required jobs, and the profits resulting from each
assignment are given below.
Jobs
1
2
3
4
5
Machines
A
B
C D E
30 37 40 28 40
40
24
27 21 36
40 32 33 30
35
25
38 40 36 36
34 39
29
62 41
Find the maximum profit possible through optimal assignment.
Hint: Note that this a maximization problem. To convert it into minimization problem and apply
Hungarian method, subtract all the elements of the profit matrix from its highest element. Use the optimal
assignments to calculate the maximum profit.
Transcribed Image Text:Question 1 Five different machines can do any of the five required jobs, and the profits resulting from each assignment are given below. Jobs 1 2 3 4 5 Machines A B C D E 30 37 40 28 40 40 24 27 21 36 40 32 33 30 35 25 38 40 36 36 34 39 29 62 41 Find the maximum profit possible through optimal assignment. Hint: Note that this a maximization problem. To convert it into minimization problem and apply Hungarian method, subtract all the elements of the profit matrix from its highest element. Use the optimal assignments to calculate the maximum profit.
Expert Solution
steps

Step by step

Solved in 4 steps with 5 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,