Exam 19: Solution Procedures for Transportation and Assignment Problems
Exam 1: Introduction49 Questions
Exam 2: An Introduction to Linear Programming52 Questions
Exam 3: Linear Programming: Sensitivity Analysis and Interpretation of Solution47 Questions
Exam 4: Linear Programming Applications in Marketing, Finance and Operations Management38 Questions
Exam 5: Advanced Linear Programming Applications35 Questions
Exam 6: Distribution and Network Problems54 Questions
Exam 7: Integer Linear Programming43 Questions
Exam 8: Nonlinear Optimization Models48 Questions
Exam 9: Project Scheduling: Pertcpm44 Questions
Exam 10: Inventory Models51 Questions
Exam 11: Waiting Line Models48 Questions
Exam 12: Simulation49 Questions
Exam 13: Decision Analysis42 Questions
Exam 14: Multicriteria Decisions45 Questions
Exam 15: Forecasting47 Questions
Exam 16: Markov Processes41 Questions
Exam 17: Linear Programming: Simplex Method46 Questions
Exam 18: Simplex-Based Sensitivity Analysis and Duality34 Questions
Exam 19: Solution Procedures for Transportation and Assignment Problems42 Questions
Exam 20: Minimal Spanning Tree18 Questions
Exam 21: Dynamic Programming30 Questions
Select questions type
A professor has been contacted by four not-for-profit agencies that are willing to work with student consulting teams. The agencies need help with such things as budgeting, information systems, coordinating volunteers, and forecasting. Although each of the four student teams could work with any of the agencies, the professor feels that there is a difference in the amount of time it would take each group to solve each problem. The professor's estimate of the time, in days, is given in the table below. Use the Hungarian method to determine which team works with which project. All projects must be assigned and no team can be assigned to more than one project. Projects Team Budgeting Information Volunteers Forecasting A 32 35 15 27 B 38 40 18 35 C 41 42 25 38 D 45 45 30 42
(Essay)
4.9/5
(41)
Showing 41 - 42 of 42
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)