{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Proj2_G2 - STQP 2043 OPERATIONS RESEARCH SEMESTER I SESSION...

This preview shows pages 1–2. Sign up to view the full content.

STQP 2043 OPERATIONS RESEARCH SEMESTER I SESSION 2009/2010 PROJECT 2 GROUP 2 1) 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. However, due to some complications, Team A is not allowed to help with the budgeting. Project 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 a) Formulate an LP model for the problem. b) Use Hungarian method to see which team works with which project. c) Use LINDO or Excel Solver to support your optimal solution. 2) Use Djikstra’s algorithm to find the shortest path between City A and City 10 in the following network. 20 20 10

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.
• Spring '10
• profsyed
• Harshad number, student consulting teams, OPERATIONS RESEARCH SEMESTER, Adamin, Pessimisti Predecessor Time

{[ snackBarMessage ]}

### Page1 / 2

Proj2_G2 - STQP 2043 OPERATIONS RESEARCH SEMESTER I SESSION...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online