Name:

Enrolment No:

UNIVERSITY OF PETROLEUM & ENERGY STUDIES

Online End Semester Examination – Dec, 2020

Course: Supply Chain Modeling, Design and Simulation Semester: III

Subject/: MBA LSCM Time: 3 Hours
Course Code: LSCM8006 Max. Marks: 100
SECTION A
1. Each Question will carry 5 Marks
2. Instruction: Complete the statement / Select the correct answer(s)
S.No. Question COs
problems have applications in communication networks while
Q1 problems are used for network of pipelines. CO1

The types of models discussed using AMPL are _ ,

Q2 and . CO1

Select all the correct statements

a. Aggregate planning is type of dynamic programming
Q3 b. Three jug puzzle is type of shortest route algorithm CO1
c. Length of a system in single server model is equal to length of queue + 1
d. AMPL is used for solving Linear programming problems
The Kendall’s Notation comprise of ,_ ,
Q4 , , and . CO3

The two approaches for time advance in simulation are and

Q5 . The elements of discrete event simulation are , CO4
and .

Q6 property is used to reduce the size of game theoretic problem. CO4

point is reached if payoff matrix reduces to single strategy.
SECTION B
1. Each question will carry 10 marks
2. Instruction: Solve the numerical problems
Solve the following stage coach problem using Dynamic Programming. There
Q7 are 6 nodes and the arcs and distances (in brackets) are given: 1-2(8), 1-3(10), 2- CO2
4(7), 2-5(9), 3-4(4), 3-5(5), 4-6(12), 5-6(8)

ANSWER:-

There are 4 stages in this problem which can be represented as follows:

Stage 1: node 1
Stage 2: node 2 and 3
Stage 3: node 4 and 5
Stage 4: node 6
We need to find the minimum distance from node 1 to 6 using dynamic programming.
 We will use backward recursion in this problem and the recursive equation for the same is:

F(xn) = Minimum of {D(xn,ym) + F(ym)}

Where, F(xn) = the minimum distance from the nth node of a stage to the end of the network.

F(ym) = the minimum distance from the mth node of the next stage to the end of the network.

D(xn,ym) = distance between the nth node of the stage and the mth node of the next stage.

Therefore, we can use this formula to calculate the minimum distance for each node in each stage.

Stage 4:

Node 6: F(6) = 0, Since it is the final node.

Stage 3:

Node 4: F(4) = Minimum {(the distance between 4 and 6) + (the minimum distance between 6 to 6)}
= 12 + 0 = 12

Node 5: F(5) = Minimum { (the distance between 5 and 6) + (the minimum distance between 6 to 6)}
=8+0=8

Stage 2:

Node 2: F(2) = Minimum {(the distance between 2 and 4) + (the minimum distance between 4 to 6),
(the distance between 2 and 5) + (the minimum distance between 5 to 6)}

= Minimum {(7 + 12), (9 + 8)} = Minimum {19, 17} = 17

Node 3: F(3) = Minimum {(the distance between 3 and 4) + (the minimum distance between 4 to 6),
(the distance between 3 and 5) + (the minimum distance between 5 to 6)}

= Minimum {(4 + 12), (5 + 8)} = Minimum {16, 13} = 13

Stage 1:

Node 1: Minimum {(the distance between 1 and 2) + (the minimum distance between 2 to 6), (the
distance between 1 and 3) + (the minimum distance between 3 to 6)}

= Minimum {(8 + 17), (10 + 13)} = Minimum {25, 30} = 25

So, the minimum distance to 6 from node 1 passes through node 2, as seen in stage 1 calculations.

The minimum distance to 6 from node 2 passes through node 5, as seen in stage 2 calculations.

The minimum distance to 6 from node 5 completes the route, as seen in stage 3 calculations.

Hence, the minimum distance path, as seen from the stagewise calculations above, passes
from node 1 – node 2 – node 5 – node 6.
Thus, the minimum distance from node 1 to node 6 is 25.

There are two items with the data given below. The restriction on total number
Q8 of orders is 18. Find the EOQ value for individual items and total cost. CO2
Item 1 Item 2
Annual Demand 10000 20000
Order Cost 300 300
Unit Price 20 25
 CO4

Consider a two person zero sum game with the data given below. Player A has
three strategies and player B has three strategies. Solve the problem to get
Q9 steady state payoff
4 3 -2
-1 4 2
 1 -2 -4

ANSWER:-
The following would be the payoff matrix of the respective players if it is a zero sum game:

The first payoff in the brackett is that of the first player and the second payoff in the brackett is that
of the second player.

Finding the steady state payoff:

There is no steady state (Nash equilibrium) payoff in the given game. Given if first player follows
first strategy, second player will follow third strategy due to higher payoff (in bold and underline).
Now, given if player one follows second strategy, player two will follow first strategy due to higher
payoff. If player one follows third strategy, player two will follow thord strategy due to higher payoff.

Now, considering that of player two. If he follows first strategy, player one in this case will follow first
strategy due to higher payoff. If player two follows second strategy, player one will follow second
strategy due to higher payoff. If player two follows third strategy, then player one will follow second
strategy due to higher payoff.

Hence, there is no common strategy which both the players would like to follow simultaneously. As
a result, there is no steady state payoff.
 Use the Floyd’s Algorithm to find the shortest distance from depot Z to depot A

X 360
250 Q 200
A
Q 10 Z 500 CO2
150 110
100
100
350
W D
Y 250

Cranberry Ltd has an arrival rate of delivery vans of 24 vans during an eight-
hour day while an average of five vans can be loaded during an hour.
Q 11 Find the following: CO3
a) Utilization factor,
b) Average number of customers in the system
c) Average queuing time?

ANSWER:-

Arrival time = 24/8 = 3 per hour

Service time = 5 per hour.

Utilization factor = arrival time /service time

= 3/5

= 60%

b) average number of customers in the system

Ls = arrival time /service time - arrival time

= 3/5-3

= 1.5

c) average queuing time

Wq = arrival time /service time (service time - arrival time)

 = 3/5(5-3)

= 0.3

Section C
1. Each Question carries 20 Marks.
2. Instruction: Solve any one case study

An outdoors person who lives in New Delhi (ND) wishes to spend a 15-day
vacation visiting four national parks:Rajaji (RJ), Jim Corbett (JC), Khirganga
(KG), and Gir Forest (GF). The tour, which starts and ends in New Delhi, visits
the parks in the order ND->RJ->JC->KG->GF->ND and includes a 2-day stay
at each park. Travel from one park location to another is either by air or car.
Q 12 Each leg of the trip takes 1/2 day if traveled by air. Travel by car takes 1/2 day CO4
from ND to RJ, 3 days from RJ to JC, one day from JC to KG, 2 days from KG
to GF, and 3 days from GF back to ND. The tradeoff is that car travel generally
costs less but takes longer. Considering that the individual must return to work
in 15 days, the objective is to make the tour as inexpensively as possible within
the 15-day limit. Table below provides the one-way cost of traveling by car and
air. Determine the mode of travel on each leg of the tour.
 Air travel cost($) to Car travel cost($) to
From ND RJ JC KG GF ND RJ JC KG GF
ND - 150 350 380 450 - 130 175 200 230
RJ 150 - 400 290 340 130 - 200 145 180
JC 350 400 - 150 320 175 200 - 70 150
KG 380 290 150 - 300 200 145 70 - 100
GF 450 340 320 300 - 230 180 150 100 -

OR

A commuter airline prides itself on customer service, with features such as

providing its morning passengers with a copy of “The Wall Street Journal”. The
paper costs $ 1.50 per issue. The newsstand price is $ 2.50. The salvage value of
the newspaper is $0.50. What size subscription should be ordered if a small
plane with only six seats have experienced the demand distribution below:

ANSWER:-

Passengers 2 3 4 5 6
Probability 0.1 0.2 0.2 0.3 0.2