8

Operations Research Techniques:

 11
2)
 13
Defense
 15
Distribution
 16
Air
 20
BUT THEY ARE NOT
 25

Nodes
 37
Fig. 16
 Schedule
Fig. 18
 + tp 4t
e
 tp − o t
t
=

tp
= ⎜
t ⎜
T
= +
⎡T T
z =⎢
⎣ σ ⎦
 to 4t p +
e =
e = (42 36)/5 = 1.2
 49
RESOURCE SCHEDULING IN NETWORK
1

2×
 2C D
=
2 C

+
3
= 0
 CD
2

2 100 12000
Im

(13)
 × C ×
1 3 m

(Q S )2
3

− S)

S
4

′ = + +C +
1 D
C QD CD C Q S) D
+ +
Q Q

1
Q

C + +C −C D
− ×
2 (C 4)
+C 2 2Q
which is the economic or optimum order quantity.

3
C1 = Rs. 1/item

C 2 400 18000
=

= D I = 3110/1500
max
Rs.5 747 0.5
′ = 1
C2 (Q R)(R − D) + ×
m
= QRDR = 4470 1

=
′ = C t m 2+ S )I 2 +
1 4 3

− 2C D =
C
 Q

t t
2 12000 20
= 1017
2.90 0.16

2 12000 20
= 1026
2.85 0.16
or 2% per month.
n2Rn+1.
 300
(Unit)

10
(Rs.)
Annual usage
+
procurement time is 12 days and mum, minimum and average inventories.

2C D
C
∑ (Frequency lead time)

6 12 20 24 14 6 18 10

∑ (Frequency demand/day)

0 4 10 15 16 10 6 14
Holding cost = 24%

2C D

= 1000 items
Probability
=
(hours/unit)
Z = Rs. 4X1 + 5X2
 Cost
(people/ad or commercial)
aij = co-efficient of the jth constraint and ith variable

ax
ij
REVIEW QUESTIONS

Department
0
⎬
Ax + ⎭B
 103
SOLUTION TO LINEAR PROGRAMMING PROBLEMS
Co-ordinates
Z = 4x + 7y
 2x1 + 3x2 > 90
and x, y >0
(2)
(3)
1

1
S 3
= 40 + S
 121
REVIEW QUESTIONS
of production
1 + 3
50 x +
1 3
25
1 3
26
1
 1

1 + 3
12 2x +
1 3
12
1
1
= ⎪ 40
Basic variables
2
⎪
3
= −60
⎭

= ⎫
Z − 2x − 5y +

- S3 + A = 60
1/5

3
x1, x2 > 0
5/11
 Coefficient of

Coefficient of
Coefficient of
y
 140
Solution:
 x 0 = 2x 1 + x 2 + x 3
Subject to

Z = 3x1 + 2.5 x2
Subject to
0
Coefficient of
 145
Example
0
Coefficient of
x

Coefficient of
x
Coefficient of
x

Coefficient of
x
Coefficient of

Coefficient of
Coefficient of
y

Coefficient of
y
x, y>0
S1
S2 0
0
 Z = 4x 1 + 2x 2 + x 3
Subject to

Z = 4x1 + 3x2
Subject to b) Maximize

Z = 3x 1 + x 2
Subject to
1 ⎤
⎢ ⎥
⎢2 ⎥
Example

+
and y2 be the dual variables corresponding to the primal problem.

−
There are two constraints. Therefore we have two dual variables y1 and y2. Then we have the dual as
Z = 4x 1 + 3 x 2 + 6x 3

x1 , x2 , x3 > 0
 S1
2
 i
∑ ay
can also be interpreted as the impu
i=1 ij

∑ ay
i=1 ij
 Zx = 3x1 + 4x2
Subject to
Available
11
+ 12

21
+ x

m1

+ x
11

+ x
12

+ x
1n

, 12
,…,
mn
≥ x 0
11

+a
+
Least Cost Method

7
7 8

7
 6
4
 7
5
 50
7
 175
REVIEW QUESTIONS
 176
MOVING TOWARDS OPTIMALITY
= i
∑ ij for i x
j=1

⎥
i ∑ ij
⎥
=

∑ i ua
=1
 Supply
P
 Q

C
5
 187
Example:
 -28
-38
 0 70

Evaluation of ui's and vj's

 190
Table 54
 192
REVIEW QUESTIONS
 193

8
1
10
40
66
14 56
31 93
 -

14
50

F
 2
10 34
2 30
A B C D

i=1
for job 2
for job 3
for job 4

for person 2
for person 3
for person 4
 207
MULTIPLE SOLUTIONS
 0 0x 5 4 7

0x 3 0 4 0

0x 1 0 3 0

6 5 0x 0 0x

0 0x 5 4 7

0x 3 0 4 0x

0 1 0x 3 0
 5 0 3 2 6
2 0 0x 5 4 7
 210
Example 1
 20C

17.5D
8.5C 18D
1 2 3 4 5 6

1 2 3 4 5 6
 219
Example
Jobs
 226
INTRODUCTION
⎛ Probability
⎝ of at time t

⎤⎦ (1− Δ ) ( Pt
⎣ n

Pt 1− Δ − Δ +λμ(Δt) n

P
n +

⎛ Probability
⎝ of n+1 at time t

⎣ n P
 Pt =
n

P
n+1

μ Δt ( λ t λ μ
n+1 ( ) n n−1
 ) (

0
+ = case 1 and case 2 t)

Pt λ Pt μ Pt (Δt )2 t λμ
0 1 1

Pt λ t
0 1
 λ ⎛
P P =P = ⎜
= ,
3 0 ⎝
4 0
⎝μ ⎠ 0 ⎝ μ
 +3 + ⎟
⎠

⎥
+
⎠

2 3 4
λ ⎛ ⎟ λ⎛ ⎟ ⎞ ⎞
⎛ ⎟ λ λ
= + + + ⎜
3⎜ 2" ⎜
μ ⎝μ ⎝μ ⎝ ⎠

− λ μ

λ ⎞
− ⎟
μ
⎠
 2 λ
= λ μ
n ( − −
 1
μ λ

⎟ (λ μ )w
dw
⎠

v
(
 λ
= 3
μ λ 2

6
 λ
=
μ

1
= =
μ λ 20 12
 2
44 16
= =

μ μ λ)

1
=
 1
=
12
1
0.25 per min
4

= 4 12 = 13
∞

− ⎦10 ⎢
⎣

λ
=
μ λ 0.25 0.085
 k
1 kμ
k!⎝

P 1 ⎛λ ⎟
n =
n! ⎝ μ
 =
0 ⎛ ⎞ 5 5 1
+ × ⎜ ⎟ + ×⎜ ⎟ ×
⎝ ⎠ 2 3 6 3 42 ⎝ ⎠ ⎝ ⎠

+ 2 p P
0 2
 = ×

nM n
⎢ M ⎜ !⎥

⎛ ⎞n
= ⎜ ⎟ λ
n 0
⎝ (M n)! !
n
=
(M n k k

=8
=2

⎡ ⎤ n
⎢ 3! ⎥
⎟
Example

cost (Rs.)
 1 − v
Pn
n
1 − v
 = 0.909
1 0.1
 vn-1 Rn
cost,
Table 10
year = 12 x pi
7
f2*(s) x2*
f3*(s) x3*
for C
 three ventures
D
for A
 267
Case 1
 268
Two Stage Problem:
 269
EXERCISES
 271
SEQUENCING
Z = 2x + 10y

x <2
 277

Best wishes for the decision