Homework Help is Here – Start Your Trial Now!
Business
Operations Management
IN CLASS EXERCISE 2: 2. MAXIMISATION PROBLEM Electrician PROJECT C 38 32 Eli 38-34 26 Fami 38-30 28 30 26 George 3P-38 26 24 32 Haris 8-22 26 28 20

IN CLASS EXERCISE 2: 2. MAXIMISATION PROBLEM Electrician PROJECT C 38 32 Eli 38-34 26 Fami 38-30 28 30 26 George 3P-38 26 24 32 Haris 8-22 26 28 20

Practical Management Science
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
See similar textbooks
icon
Related questions
Question
54 PQS 2133 : MANAGEMENT SCIENCE 6.3: ASSIGNMENT MODEL The second special-purpose LP algorithm is the assignment method. Each assignment problem has associated with it a table, or matrix. Generally, the rows contain the objccts or pcoplc we wish to assign, and the columns comprise the tasks or things we want them assigned to. The numbers in the table are the costs associated with each particular assignment. The assignment model using the Hungarian Method Flood's technique) tan solve 3 types of assignment problem. 1. Minimization problem (Hungarian Method) basic concept. 2. maximization assignment problem 3. unbalance assignment problem 6.3.1: HUNGARIAN METHOD - MINIMIZATION PROBLEM 1. Find the opportunity cost table by: • Subtracting the smallest number in each row of the original cost table or matrix from every number in that row. Show the solution in the new table. Then subtracting the smallest number in each column of the table obtained in part (a) from every number in that column. Show the solution in the new table. 2. Test the table resulting from step 1 to see whether an optimal assignment can be made. > Test the table whether can assign 1 to 1 basis? > If YES, draw the vertical and horizontal straight lines to cover all zeros in the table. The number of lines must equals either the number of rows or columns in the table, an optimal assignment can be made. > If NO. The procedure is to draw the minimum number of vertical and horizontal straight lines necessary to cover all zeros in the table. The number of lines must be less than the number of rows or columns then proceed to step 3. 3. Revise the present opportunity cost table. > This is done by subtracting the smallest number not covered by a line from every other uncovered number. > This same smallest number is also added to any number(s) lying at the intersection of horizontal and vertical lines. > We then return to step 2 and continue the cycle until an optimal assignment is possible.
Transcribed Image Text:54 PQS 2133 : MANAGEMENT SCIENCE 6.3: ASSIGNMENT MODEL The second special-purpose LP algorithm is the assignment method. Each assignment problem has associated with it a table, or matrix. Generally, the rows contain the objccts or pcoplc we wish to assign, and the columns comprise the tasks or things we want them assigned to. The numbers in the table are the costs associated with each particular assignment. The assignment model using the Hungarian Method Flood's technique) tan solve 3 types of assignment problem. 1. Minimization problem (Hungarian Method) basic concept. 2. maximization assignment problem 3. unbalance assignment problem 6.3.1: HUNGARIAN METHOD - MINIMIZATION PROBLEM 1. Find the opportunity cost table by: • Subtracting the smallest number in each row of the original cost table or matrix from every number in that row. Show the solution in the new table. Then subtracting the smallest number in each column of the table obtained in part (a) from every number in that column. Show the solution in the new table. 2. Test the table resulting from step 1 to see whether an optimal assignment can be made. > Test the table whether can assign 1 to 1 basis? > If YES, draw the vertical and horizontal straight lines to cover all zeros in the table. The number of lines must equals either the number of rows or columns in the table, an optimal assignment can be made. > If NO. The procedure is to draw the minimum number of vertical and horizontal straight lines necessary to cover all zeros in the table. The number of lines must be less than the number of rows or columns then proceed to step 3. 3. Revise the present opportunity cost table. > This is done by subtracting the smallest number not covered by a line from every other uncovered number. > This same smallest number is also added to any number(s) lying at the intersection of horizontal and vertical lines. > We then return to step 2 and continue the cycle until an optimal assignment is possible.
Pilth satm no Palmg besar dimtabel tolak gan semua 56 PQS 2133 : MANAGEMENT SCIENCE IN CLASS EXERCISE 2: 2. MAXIMISATION PROBLEM Electrician PROJECT D A 32 Eli 38-34 26 38 Fami 38-30 30 26 28 George S-38 26 24 32 Haris 8- 22 20 26 28
Transcribed Image Text:Pilth satm no Palmg besar dimtabel tolak gan semua 56 PQS 2133 : MANAGEMENT SCIENCE IN CLASS EXERCISE 2: 2. MAXIMISATION PROBLEM Electrician PROJECT D A 32 Eli 38-34 26 38 Fami 38-30 30 26 28 George S-38 26 24 32 Haris 8- 22 20 26 28
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Decision making patterns
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.
SEE MORE TEXTBOOKS