Está en la página 1de 10

MTS254 Introduction to Management Science

Solution of Practice Exercise for Final Exam


1) Solve the minimal-spanning tree problem defined below:


Start
End
Branch Node
Node
Cost
1
1
3
5
2
1
2
1
3
2
4
3
4
2
5
4
5
3
4
6
6
4
6
2

total cost = 15

2
4

5
6

2) Develop the linear programming model to find the maximal flow from Node 1 to Note 4:

From
To
Fluid
Node Node Flow
1
3
200
3
1
0
1
2
150
2
1
50
2
3
100
3
2
100
3
4
150
4
3
50

0
200

150

100

50

150

50

100

Max x41
Subject to
x41 = x13 + x12
x12 + x32 = x23
x13 + x23 = x32 + x34

x34 = x41
x13 200, x12 150, x32 100, x23 100
x34 150
All variables 0

3) Use the following information



Given the network in Figure above, What is the critical path?

14

18

14

14

18

14

14

15

12

15

14

18

14

14

18

14

14


0
5
5
9

0
5
5
9




Given the network in Figure above, the critical path is

B-D-E-F-H.

15

12

18

18

25

18

25

18

25

18

25

4) Bastille College is going to purchase new computers for both faculty and staff. There are a total of
50 people who need new machines 30 faculty and 20 staff. The cost of the basic personal
computer with monitor and disk drive is $2,000, while the deluxe version with VGA and advanced
processor is $3,500. Due to internal politics, the number of deluxe computers assigned to staff must
be less than half the number of deluxe computers assigned to faculty. The College feels that it must
purchase at least 5 deluxe computers for the faculty; if possible, it would like to purchase as many as
20 deluxe computers for the faculty. Staff members do feel somewhat "put upon" by having a limit
placed upon the number of deluxe machines purchased for their use, so the College would like to
purchase as many deluxe machines for the staff as possible (up to 10). The budget is $100,000.
Develop a goal programming formulation of this problem that treats each of the requirements
stated above as an equally weighted goal.
Let FR = number of regular computers purchased for faculty use

FD = number of deluxe computers purchased for faculty use

SR = number of regular computers purchased for staff use

SD = number of deluxe computers purchased for staff use


d1- = underachievement of minimum faculty deluxe computers

d1+ = overachievement of minimum faculty deluxe computers


d2- = underachievement of maximum faculty deluxe computers
d2+ = overachievement of maximum faculty deluxe computers
d3- = underachievement of deluxe ratio
d3+ = overachievement of deluxe ratio
d4- = underachievement of total faculty computers
d4+ = overachievement of total faculty computers
d5- = underachievement of maximum staff deluxe computers
d5+ = overachievement of maximum staff deluxe computers
d6- = underachievement of total staff computers

d6+ = overachievement of total staff computers


d7- = underachievement of budget

d7+ = overachievement of budget

It might not be clear but the following is the goals of the problem:
Goal 1: At least 5 faculty deluxe computers
Goal 2: At most 20 faculty deluxe computers (as many as 20 so cannot exceed 20)
Goal 3: Staff deluxe computer is at most 50% of faculty deluxe computer
Goal 4: At least total 30 faculty computers. More than 30 is ok but less than 30 is not ok
Goal 5: At least 10 staff deluxe computers
Goal 6: At least total 20 staff computers. More than 20 is ok but less than 20 is not ok
Goal 7: Used at most 100,000 budget. More than 100,000 is not ok but less than 100,000 is ok

Minimize
Subject to:

d1- + d2+ + d3+ + d4- + d5- + d6- + d7+


FD + d1- - d1+ = 5
Deluxe faculty
Deluxe faculty

FD + d2- - d2+ = 20
-0.5FD + SD + d3- - d3+ = 0

FD + FR + d4- - d4+ = 30

Total faculty

SD + d5- - d5+ = 10

Deluxe Staff

SR + SD + d6- - d6+ = 20

Deluxe ratio

Total staff
3500FD + 2000FR + 2000SR + 3500SD + d7- - d7+ =100000

all variables 0

Budget

5) Consider the following network model. The transportation costs are shown
above the arcs. The supply capacities are shown in the left of plant nodes and
the demands are shown on the right of retail nodes. Develop the LP model to
find how to satisfy the demand with minimal cost.

6) Consider the network below. Develop the LP model to find shortest path
from node 1 to node 6.

7) The bank head quarter is trying to locate the minimal number of branches to
serve all 20 counties below. If a branch is set up at a county, it can serve all
adjacent counties as well. The list of adjacent counties is shown below. Develop
LP model to find the minimal number of branches to cover all counties.

8) A company has 3 clients to serve. There are 3 available project leaders to


complete the projects. The table below shows the completion of the project is
the particular project leader leads the project. Develop the LP model to find how
to assign the project leader to client such that the total completion time is
minimized.

9) Consider the project relationship diagram below. The normal time and crash
time and related crash costs are shown in the table below. Develop the LP
model to reduce project completion time to 12 weeks.

xi = earliest start time of task i (not the same as earlier solution)


yi = crash time of task i
Minimize 1000 ya + 2000 yb +1000 yc +1000 yd +1000 ye + 500 y f + 2000 yg + 3000 yh
subject to
Task A and B no constraint
xc xa + (2 ya )
xd xb + (3 yb )
xe xc + (2 yc )
x f xc + (2 yc )
xg xe + (4 ye )
xg xd + (4 yd )
xh xg + (5 yg )
xh x f + (3 y f )
xh + (2 yh ) 12
ya 1; yb 2; yc 1; yd 1; ye 2; y f 1; yg 3; yh 1;
All variables 0