SOAL TUGAS RO II

1. Consider the problem :

Maximize Z = 2 x1 + x2
Subject to:
10 x1 + 10 x2 9
10 x1 + 5 x2 1
With x1; x2 0 and integer

Verify the solution by using the cutting plane method and the branch and bound algorithm

2. Consider the problem :

Maximize Z = x1 + x2
Subject to:
2 x1 + 5 x2 19
6 x1 + 5 x2 30
With x1; x2 0 and integer
Find the optimal integer solution by using the brand and bound algorithm!
3. Use Balas additive algorithm to solve the following problem
Maximize Z = 7 x1 + 9 x2 10 x3
Subject to:
x1 + 2 x 2 - x3 2
2 x 1 + x2 + x 3 3
With x1; x2 = 0 or 1
4. A drive-in restaurant the large rant has a single order window. Customers arrive at the
restaurant according to a Poisson input process at a mean arrival rate of 30 per hour. Customer
orders can be prepared at average rate of 40 orders per hour. Determine L, Lq, W, and Wq for
this system.
5. The arrivals of customers (cars) at a large drive-in banking facility are Poisson distributed at a
rate of = 1.0 car per minute. The drive bank facility has three tellers, each of which can service
customers at a rate of = 0.6 cars per minute. Determine the operating characteristics for this
queueing system , that is, determine P0, P5, L, Lq, W and Wq.
6. In a research and development project, the various activities and the time estimates are:
activities Optimistic estimate Most likely estimate Pessimistic estimate
12 3 4 6
13 1 2 4
23 1 3 5
24 6 8 12
34 2 3 5
35 1 2 4
46 4 5 9
56 4 6 11
 a. Using the three estimates shown above, calculate the expected value using the standard
deviation of the expected value of the time required for each activity
b. Using the expected value time, determine the the critical path for the network.
c. Assume that the network planners would like to complete all their planning activities within
16 weeks . What is the likelihood of this occurring?
7. In a research and development project, the various activities can be crashed ant various costs
and with various time reductions. The following table lists the various activities and the
associated time and cost information.
Activity Regular time (days) Crash time (days) Daily Crash Cost ($)
AB 3 2 100
AC 4 2 150
BD 3 3 200
BE 6 4 125
CD 7 5 175
CE 5 4 225
DF 8 5 200
DG 9 5 180
DH 10 7 200
EF 9 7 190
EG 8 6 150
EH 11 9 175
FI 7 5 225
GI 8 5 210
HI 9 6 200

a. Draw the network diagram for the project and determine the critical path, assuming that no
activity are crashed.
b. Determine the least-cost sequence to crash activities in order to complete the project in 26
days.