1. A retail store stocks two types of shirts A and B.

These are packed in attractive

cardboard boxes. During a week the store can sell a maximum of 400 shirts of type A and
a maximum of 300 shirts of type B. The storage capacity, however, is limited to a
maximum of 600 of both types combined.Type A shirt fetches a profit of Rs. 2/- per unit
and type B a profit of Rs. 5/- per unit. How many of each type the store should stock per
week to maximize the total profit? Formulate a mathematical model of the problem.
Ans:

x = number of type A shirts to be stocked per week

y = number of type B shirts to be stocked per week

We're given the following constraints:

​ Selling a maximum of 400 shirts of type A: x≤400

​ Selling a maximum of 300 shirts of type B: y≤300
​ Total storage capacity for both types:
​ x+y≤600

The objective is to maximize the total profit:

Total profit =2x+5y

So, the mathematical model for this problem is:

Maximize: Z=2x+5y

Subject to the constraints:

​ x≤400
​ y≤300
​ x+y≤600

This model will help determine the optimal number of type A and type B shirts to be stocked to
maximize the total profit while considering the constraints on sales and storage capacity.
2) One unit of product A contributes Rs. 7 and requires 3 units of raw material and 2 hours of
labor.One unit of product B contributes Rs. 5 and requires one unit of raw material and one
hour of labor. Availability of raw material at present is 48 units and there are 40 hours of labor.
Formulate this problem as a linear programming problem.

Ans: x = number of units of product A

y = number of units of product B

Objective: Maximize the total contribution (profit)

Total contribution =7x+5y

Subject to the constraints:

​ Raw material constraint: 3x+y≤48 (Product A requires 3 units and product B

requires 1 unit of raw material)
​ Labor constraint: 2x+y≤40 (Product A requires 2 hours and product B requires 1
hour of labor)

The linear programming model for this problem is:

Maximize: Z=7x+5y

Subject to the constraints: 3x+y≤48

2x+y≤40

This model helps determine the optimal number of units of product A and product B to
produce in order to maximize the total contribution (profit) while considering the
constraints on raw material availability and labor hours.

3. A trucking firm has received an order to move 3,000 tonnes of industrial material to a
destination 1,000 km away. The firm has available, at the moment, a fleet of 150 class-A
15-tonne trailer trucks and another fleet of 100 class-B 10-tonne trailer trucks. The operating
costs of these trucks are Rs 3 and Rs 4 per tonne per km, respectively. Based on past
experience, the firm has a policy of retaining at least one class-A truck with every two class-B
trucks in reserve. It is desired to know how many of these two classes of vehicles should be
dispatched to move the material at minimal operating costs. Formulate this problem as an LP
model.
Ans: x = number of class-A 15-tonne trailer trucks to be dispatched
y = number of class-B 10-tonne trailer trucks to be dispatched

Objective: Minimize the operating costs for transporting the material

The operating cost for class-A trucks is Rs 3 per tonne per km, and for class-B trucks,
it's Rs 4 per tonne per km. The total distance to be covered is 1,000 km for moving 3,000
tonnes.

The total operating cost can be represented as:

Total operating cost = 3x×15×1,000+4y×10×1,000

Subject to the constraints:

​ Total weight capacity constraint:

​ 15x+10y≥3,000 (Considering the total weight of material to be transported)
​ Truck availability:
​ x≤150 (Available class-A trucks)
​ Truck availability:
​ y≤100 (Available class-B trucks)
​ Policy of retaining at least one class-A truck with every two class-B trucks:
​ x ≥ y/2
​ The linear programming model for this problem is:
Minimize:Z=3x×15×1,000+4y×10×1,000
​ Subject to the constraints:
​ 15x+10y≥3,000
​ x≤150
​ y≤100
​ x≥ y/2

This model helps determine the optimal number of class-A and class-B trucks to be
dispatched to move the material at minimal operating costs while considering the
constraints on truck availability, weight capacity, and the policy of retaining trucks.

4. Solve the following LPP graphically

Max Z = 4x + 5y
Subject to
x + y ≤ 20
3x + 4y ≤ 72
x, y ≥ 0

Ans:
The North West Corner (NWC) method is a technique used to find the initial feasible
solution for a transportation problem. In this method, you start from the top-left corner
(North West corner) of the transportation table and allocate shipments as much as
possible according to the supply and demand.

Let's solve the given transportation problem:

Supply D1 D2 D3 Demand
O1 1 2 6 7

O2 0 4 2 12

O3 3 1 5 11

Demand 10 10 10

Starting with the North West corner (O1, D1), allocate as much as possible while
considering the supply and demand:

​ Allocate 7 units from O1 to D1 (minimum of supply(7) and demand(10)):

Supply D1 D2 D3 Demand

O1 1 2 6 0

O2 0 4 2 12

O3 3 1 5 11

Demand 3 10 10

​ Move to the next cell (O1, D2) and allocate the maximum possible:

Supply D1 D2 D3 Demand

O1 1 1 6 0

O2 0 3 2 12

O3 3 1 5 11

Demand 3 7 10
 ​ Now, allocate the remaining supply from O1 to D3:

Supply D1 D2 D3 Demand

O1 1 1 5 0

O2 0 3 2 12

O3 3 1 5 11

Demand 3 7 5

Now, update the supply and demand values. The supply from O1 is exhausted, and the
demand for D3 is met. There is unfulfilled demand at D2 for O2 and O3. There is
unfulfilled supply at O3 for D2.

This represents the initial feasible solution using the North West Corner method.
To solve the traveling salesman problem (TSP), let's find the shortest route that visits each city

exactly once and returns to the starting city with the minimum total distance. The given matrix

represents the distances between cities.

The matrix provided represents the distances between cities:

| | 1 | 2 | 3 | 4 |
|----|-----|-----|-----|-----|
| A | - | 46 | 16 | 40 |
| B | 41 | - | 50 | 40 |
| C | 82 | 32 | - | 60 |
| D | 40 | 40 | 36 | - |

This problem involves finding the shortest path that visits each city exactly once and returns to the

starting city. Given the small number of cities, an approach like brute force or heuristic algorithms

(e.g., nearest neighbor) could be applied.

Let's use the brute force approach to check all possible permutations and find the shortest path.
By examining all possible permutations, calculate the total distance for each permutation of the To

solve the traveling salesman problem using brute force, we'll calculate the total distance for all

possible permutations of the cities and find the shortest path.

Given the cities A, B, C, and D, let's compute all permutations and find the shortest path:

​ A -> B -> C -> D -> A

​ A -> B -> D -> C -> A
​ A -> C -> B -> D -> A
​ A -> C -> D -> B -> A
​ A -> D -> B -> C -> A
​ A -> D -> C -> B -> A

Calculate the total distance for each permutation:

​ A -> B -> C -> D -> A: 46 + 50 + 60 + 40 = 196

​ A -> B -> D -> C -> A: 46 + 40 + 36 + 82 = 204
​ A -> C -> B -> D -> A: 16 + 50 + 36 + 40 = 142
​ A -> C -> D -> B -> A: 16 + 60 + 40 + 41 = 157
​ A -> D -> B -> C -> A: 40 + 40 + 50 + 82 = 212
​ A -> D -> C -> B -> A: 40 + 36 + 32 + 41 = 149

The shortest path with the minimum total distance is A -> C -> B -> D -> A with a total distance of

142.

Therefore, the shortest path for the traveling salesman problem in this case is to visit cities in the

order A -> C -> B -> D -> A, with a total distance of 142 units.

6)
 A B C D

A - 46 16 40

B 41 - 50 40

C 82 32 - 60

D 40 40 36 -

Let's solve it using a simple brute-force method to find the shortest route.

To simplify, let's assume the starting and ending point is A.

​ Start at A.

​ Calculate all possible routes from A to the other points (B, C, D).

​ Find the total distance for each route.

​ Choose the route with the shortest total distance.

Let's calculate the total distances for each route:

Route 1: A -> B -> C -> D -> A

Total distance = 46 + 50 + 36 + 40 = 172

Route 2: A -> B -> D -> C -> A

Total distance = 46 + 40 + 60 + 16 = 162

Route 3: A -> C -> B -> D -> A

Total distance = 16 + 32 + 40 + 40 = 128

Route 4: A -> C -> D -> B -> A

Total distance = 16 + 36 + 40 + 82 = 174

Route 5: A -> D -> B -> C -> A

Total distance = 40 + 40 + 50 + 32 = 162

Route 6: A -> D -> C -> B -> A

Total distance = 40 + 36 + 82 + 41 = 199

The shortest route among these options is Route 3: A -> C -> B -> D -> A with a total

distance of 128 units.

I II III IV

I -2 0 0 5

II 4 2 1 3

III -4 -3 0 -2

IV 5 3 -4 2
For Player B, they want to maximize their payoff, while Player A wants to minimize

Player B's payoff.

Let's find the optimal strategy for both players using the minimax algorithm:

Player A's optimal strategy:

Player A wants to minimize the maximum payoff that Player B can achieve. For each of

Player A's choices, find the maximum value Player B can get and choose the action that

minimizes this maximum value.

Player A's best choice for Player B's maximum payoff:

For action I: B can get a maximum of 5.

For action II: B can get a maximum of 3.

For action III: B can get a maximum of 0.

For action IV: B can get a maximum of 5.

Player A's best strategy is to choose action III, which gives B a maximum payoff of 0.

Player B's optimal strategy:

Knowing Player A's strategy, Player B wants to maximize their payoff based on Player A's

choice of action III.

Player B's best choice for action III (considering Player A's choice):

For action I: B gets -4.

For action II: B gets -3.

For action III: B gets 0.

For action IV: B gets -2.

Player B's best strategy is to choose action III, which gives them a payoff of 0.

So, in this case, the optimal plan for both players is to choose action III.

Let's represent this on a graph. Player A's strategies will be on the x-axis, and Player B's
strategies will be on the y-axis.

First, let's draw the best response lines for both players:

For Player A (drawing the minimum lines):

● A1's best response line is 1 (minimum in the row).

● A2's best response line is 2 (minimum in the row).

For Player B (drawing the maximum lines):

● B1's best response line is 8 (maximum in the column).

● B2's best response line is 6 (maximum in the column).
● B3's best response line is 12 (maximum in the column).

Let's plot these lines on a graph.

Player A's lines:

● A1's line: Connect (0, 1) and (2, 1) on the x-axis.

 ● A2's line: Connect (0, 2) and (2, 2) on the x-axis.

Player B's lines:

● B1's line: Connect (8, 0) and (8, 3) on the y-axis.

● B2's line: Connect (6, 0) and (6, 3) on the y-axis.
● B3's line: Connect (12, 0) and (12, 3) on the y-axis.

Now, where these lines intersect is the solution:

The intersection point is at (2, 2), which corresponds to strategy A2 for Player A and
strategy B2 for Player B.

Therefore, in this game, the optimal strategies for Player A and Player B, according to
the graphical method, are A2 and B2, respectively.

Ans: Here are the activities and their durations:

Activity 0-1 1-2 1-3 2-4 2-5 3-4 3-6 4-7 5-7 6-7
Duration 3 8 12 6 3 3 8 5 3 8

Let's create a network diagram (also known as a PERT chart) based on this information.
In a PERT chart, nodes represent activities, and edges represent the sequence of
activities with their respective durations.

First, let's list down the activities in sequence:

Activity 0-1 (Duration: 3 weeks)

Activity 1-2 (Duration: 8 weeks)
Activity 1-3 (Duration: 12 weeks)
Activity 2-4 (Duration: 6 weeks)
Activity 2-5 (Duration: 3 weeks)
Activity 3-4 (Duration: 3 weeks)
Activity 3-6 (Duration: 8 weeks)
Activity 4-7 (Duration: 5 weeks)
Activity 5-7 (Duration: 3 weeks)
Activity 6-7 (Duration: 8 weeks)

Now, let's draw the network diagram:

 0-1 (3) 1-2 (8) 1-3 (12)
| | |
V V V
2-5 (3) 2-4 (6) 3-6 (8)
| | |
V V V
|----------- 3-4 (3) 4-7 (5)
| |
V V
5-7 (3) 6-7 (8)

The numbers in parentheses represent the durations of each activity.

To determine the critical path, we need to find the longest path through the network
because the critical path is the sequence of activities that takes the longest time to
complete.

From the diagram, the longest path is:

0-1 -> 1-3 -> 3-6 -> 6-7

The critical path is therefore:

Activity 0-1 -> Activity 1-3 -> Activity 3-6 -> Activity 6-7

This path has a total duration of

3+12+8+8=31
3+12+8+8=31 weeks, and it represents the critical path through the network, meaning
any delays in these activities will directly impact the project completion time.
10.

Activity Immediate Predecessor Duration (Days)

A - 1
B A 4
C A 2
D A 3
E A 2
F E 3
G D 2
H G, F 1
I C, H 3
J B 2

Let's construct the network diagram based on this information:

A (1)
/|\ \
BCDE
| |
J F (3)
|
G (2)
\
H (1)
|
I (3)

Each node represents an activity, and the arrows show the sequence of activities. The
numbers in parentheses represent the duration of each activity.
From the diagram:

● Activity A starts the project as it has no predecessors.

● Activities B, C, D, and E can start once Activity A is completed.
● Activity J depends on the completion of Activity B.
● Activity F depends on the completion of Activity E.
● Activity G depends on the completion of Activity D.
● Activity H depends on both Activity G and Activity F.
● Activity I depends on both Activity C and Activity H.

This network diagram visually represents the dependencies and sequence of activities
within the project, illustrating the flow of tasks and their relationships.

11. Customers arrive at a one-man barber shop according to a Poisson process with a
mean interarrival time of 12 minutes Customers spend an average of 10 minutes in the
barber’s chair.
(i) What is the expected number of customers in the barber’s shop and in the queue?
(ii) How much can a customer expect to spend in the barber’s shop?

Ans:
12. The annual demand for an item is 3200 units. The unit cost is Rs.6/- and inventory
carrying charges 25% per annum. If the cost of one procurement is Rs.150/- determine
the Economic order quantity.
Ans:
1. Solve the following LPP by Graphical method: (10 Marks)
Maximize Z = 3x + 4y
Subject to,
2 X + 2 Y ≤ 80,
2 X + 4 Y ≤ 120
and X, Y>=0
Ans:
2. Use Simplex method to solve
Maximize Z=4x+10y
Subject to, 2x+y ≤ 50
2x+5y ≤ 100
2x+3y ≤ 90
and x, y ≥ 0

Ans:
Now, the most negative coefficient in the Z row is -10 for variable y in the tableau. Since
all coefficients for the decision variables are non-positive, the current solution is
optimal. The maximum value of Z = 400 is achieved at x = 0, y = 20.
3. Use the simplex method to solve the following LP problem. (10 Marks)
Maximize Z = 3x1 + 5x2 + 4x3
subject to the constraints
(i) 2x1 + 3x2 ≤ 8, (ii) 2x2 + 5x3 ≤ 10, (iii) 3x1 + 2x2 + 4x3 ≤ 15
and x1, x2, x3 ≥ 0
To solve the unbalanced transportation problem, we'll use the North-West Corner
Method followed by the Modified Distribution Method to find an initial feasible solution
and then optimize it.

Step 1: North-West Corner Method

Start by placing the allocation in the northwest corner of the transportation tableau.

S1 S2 S3 S4 Supply

F1 4 6 8 13 50

F2 70

F3 30

F4 50

Demand 25 35 105 20

Allocate as much as possible from the supply at the northwest corner (F1S1 = 25).

Update the tableau:

S1 S2 S3 S4 Supply

F1 25 6 8 13 25

F2 70

F3 30

F4 50

Demand 0 35 105 20

Step 2: Modified Distribution Method

Next, use the Modified Distribution Method to find the remaining allocations:

​ Calculate the costs for each empty cell (non-allocated).

​ Select the cell with the lowest cost.
 ​ Allocate as much as possible, updating the supply and demand.

Repeat until all supply and demand values are exhausted.

Iteration 1:

S1 S2 S3 S4 Supply

F1 25 6 8 13 25

F2 70 45

F3 30

F4 50

Demand 0 35 105 20

Allocate 20 units from F1 to S3.

Iteration 2:

S1 S2 S3 S4 Supply

F1 25 6 0 13 5

F2 70 45

F3 30 30

F4 50

Demand 0 35 85 20

Allocate 30 units from F3 to S3.

Iteration 3:

S1 S2 S3 S4 Supply

F1 25 6 0 13 5

F2 0 70 45

F3 0 0

F4 30 50

Demand 0 35 85 20

Allocate 35 units from F2 to S2.

Iteration 4:

S1 S2 S3 S4 Supply

F1 25 6 0 13 5

F2 0 35 70 10

F3 0 0

F4 30 50

Demand 0 0 85 20

Allocate 10 units from F2 to S1.

Iteration 5:
 S1 S2 S3 S4 Supply

F1 25 6 0 13 5

F2 10 35 70 0

F3 0 0

F4 30 50

Demand 15 0 85 20

Allocate 15 units from F1 to S1.

Final Allocation:

S1 S2 S3 S4

F1 15 6 4 13

F2 10 35 70 0

F3 0 0 30 0

F4 0 0 30 20

This allocation satisfies all supply and demand constraints.

To minimize the total processing time for jobs assigned to machines, we can use the

Hungarian Algorithm or the Munkres Algorithm, which is an efficient method to solve

assignment problems.

Given the processing times:

M1 M2 M3 M4 M5

J1 9 22 58 11 19

J2 43 78 72 50 63

J3 41 28 91 37 45

J4 74 42 27 49 39

J5 36 11 57 22 25

Using the Munkres Algorithm:

​ Subtract the smallest value in each row from all elements in that row.
​ Subtract the smallest value in each column from all elements in that column.
​ Cover all zeros using the minimum number of lines (horizontal and vertical).
 ​ Find the minimum number of lines required to cover all zeros.
​ If the number of lines is equal to the number of rows, an optimal assignment is
possible. If not, proceed to step 6.
​ Determine the smallest uncovered element and subtract it from all uncovered
elements, then add it to all elements intersected by the lines.
​ Repeat steps 3 to 6 until an optimal assignment is found.

Let's solve it step by step:

Step 1: Subtract the smallest value in each row from all

elements in that row.

M1 M2 M3 M4 M5

J1 0 13 49 2 10

J2 0 35 29 7 20

J3 0 -13 50 -4 4

J4 0 -32 -47 -25 -35

J5 0 -25 21 -14 -11

Step 2: Subtract the smallest value in each column from all

elements in that column.

M1 M2 M3 M4 M5

J1 0 38 70 31 45

J2 0 60 56 43 58

J3 0 0 63 33 45
J4 0 10 25 0 0

J5 0 14 42 8 14

Step 3: Cover all zeros using the minimum number of lines.

Cover the zeros using the minimum number of lines:

● One horizontal line covering the zeros in J4M4 and J4M5.

● One vertical line covering the zeros in J1M1, J2M1, J3M1, and J5M1.

Step 4: Find the minimum number of lines required to cover all

zeros.
The number of lines (2) is less than the number of rows (5). Move to step 6.

Step 6: Adjust the matrix.

Find the smallest uncovered element: 8.

Subtract 8 from uncovered elements and add 8 to elements intersected by the lines:

M1 M2 M3 M4 M5

J1 8 38 70 31 45

J2 0 60 56 43 58

J3 0 0 63 33 45

J4 0 2 17 0 0

J5 0 6 34 0 6
Step 3: Cover all zeros using the minimum number of lines.
Cover the zeros using the minimum number of lines:

● One horizontal line covering the zeros in J4M4 and J4M5.

● One vertical line covering the zeros in J2M1, J3M1, and J5M1.

Step 4: Find the minimum number of lines required to cover all

zeros.
The number of lines (2) is equal to the number of rows (5). Thus, an optimal assignment

is possible.

Final Assignment:

M1 M2 M3 M4 M5

J1 8

J2 60

J3 63

J4 0 0

J5 0 6

The optimal assignment with the minimum total processing time:

● J1 to M1 (8)
● J2 to M2 (60)
● J3 to M3 (63)
● J4 to M4 (0)
● J5 to M5 (6)
This assignment minimizes the total processing time.

Ans: This problem can be solved using various algorithms, such as the brute-force
method, dynamic programming (like Held-Karp algorithm), or heuristic approaches (like
nearest neighbor or genetic algorithms).

Let's solve it using the brute-force method for this small problem.

Here is the matrix representation:

A B C D E
A ∞ 2 5 7 1
B 6 ∞ 3 8 2
C 8 7 ∞ 4 7
D 12 4 6 ∞ 5
E 1 3 2 8 ∞

We can create permutations of the routes to find the shortest one.

The brute-force algorithm checks all possible permutations and calculates the total
distance for each permutation. Then it chooses the one with the minimum total
distance.

Let's calculate the total distance for each permutation:

​ A -> B -> C -> D -> E -> A: 2 + 3 + 4 + 5 + 1 = 15

​ A -> B -> C -> E -> D -> A: 2 + 3 + 7 + 5 + 1 = 18
​ A -> B -> D -> C -> E -> A: 2 + 4 + 6 + 7 + 1 = 20
​ A -> B -> D -> E -> C -> A: 2 + 4 + 5 + 7 + 1 = 19
​ A -> B -> E -> C -> D -> A: 2 + 2 + 7 + 4 + 1 = 16
​ A -> B -> E -> D -> C -> A: 2 + 2 + 5 + 6 + 1 = 16
​ A -> C -> B -> D -> E -> A: 5 + 7 + 3 + 5 + 1 = 21
​ A -> C -> B -> E -> D -> A: 5 + 7 + 2 + 8 + 1 = 23
​ A -> C -> D -> B -> E -> A: 5 + 4 + 6 + 8 + 1 = 24
​ A -> C -> D -> E -> B -> A: 5 + 4 + 5 + 2 + 1 = 17
​ A -> C -> E -> B -> D -> A: 5 + 7 + 2 + 6 + 1 = 21
​ A -> C -> E -> D -> B -> A: 5 + 7 + 1 + 3 + 1 = 17
​ A -> D -> B -> C -> E -> A: 7 + 4 + 3 + 8 + 1 = 23
​ A -> D -> B -> E -> C -> A: 7 + 4 + 5 + 7 + 1 = 24
​ A -> D -> C -> B -> E -> A: 7 + 6 + 7 + 2 + 1 = 23
​ A -> D -> C -> E -> B -> A: 7 + 6 + 5 + 2 + 1 = 21
​ A -> D -> E -> B -> C -> A: 7 + 5 + 2 + 4 + 1 = 19
​ A -> D -> E -> C -> B -> A: 7 + 5 + 1 + 3 + 1 = 17
​ A -> E -> B -> C -> D -> A: 1 + 3 + 3 + 5 + 1 = 13
​ A -> E -> B -> D -> C -> A: 1 + 3 + 5 + 7 + 1 = 17
​ A -> E -> C -> B -> D -> A: 1 + 2 + 7 + 4 + 1 = 15
​ A -> E -> C -> D -> B -> A: 1 + 2 + 5 + 6 + 1 = 15
​ A -> E -> D -> B -> C -> A: 1 + 8 + 2 + 4 + 1 = 16
​ A -> E -> D -> C -> B -> A: 1 + 8 + 1 + 3 + 1 = 14

The shortest route with the minimum total distance is A -> E -> B -> C -> D -> A with a
total distance of 13.
Solution:

Player A's strategies (A1, A2) will be plotted on the x-axis, and Player B's strategies (B1,
B2, B3) will be plotted on the y-axis.

Let's denote A1 as x and A2 as y for Player A, and B1, B2, B3 as points on the y-axis for
Player B.

Player A (x-axis) strategies: A1, A2

Player B (y-axis) strategies: B1, B2, B3

Here are the coordinates for the points:

● A1: (x, y) = (0, 4)

● A2: (x, y) = (1, -1)

Now, plot these points on a graph with Player A's strategies on the x-axis and Player B's
strategies on the y-axis. Draw lines connecting the points to form a polygon.

After plotting the points and forming the lines, the intersection of the lines will give you
the optimal strategies for both players. The point of intersection represents the optimal
strategy for both players in a zero-sum game.
Solution:
PLAYER B TOTAL OF
ROW

PLAYER A I II III IV

I 3 2 4 0 9

II 3 4 2 4 13

III 4 2 4 0 10

IV 0 4 0 8 12

TOTAL COL 10 12 10 12

For rows select the least value

For columns select the maximum value

In rows, I row is dominating the other rows since it is having the least value.

PLAYER B TOTAL OF
ROW

PLAYER A I II III IV

I 3 2 4 0 9

II 3 4 2 4 13

III 4 2 4 0 10

IV 0 4 0 8 12

TOTAL COL 10 12 10 12
Now lets move on to columns, where we will select the maximum value

PLAYER B TOTAL OF
ROW

PLAYER A I II III IV

I 3 2 4 0 9

II 3 4 2 4 13

III 4 2 4 0 10

IV 0 4 0 8 12

TOTAL COL 10 12 10 12

Note down the remaining values

PLAYER B TOTAL OF ROW

PLAYER A I III

II 3 2 13

IV 0 0 12

TOTAL COL 10 10

Now in the above table again will select the row which is having least value
Since now only one column is left, so we dont have to calculate the total.

The value for the game is = 3

A[PI, PII, PIII,PIV] = A[0,0,1,0]
B[P1,PII,PIII,PIV] = B[1,0,0,0]

Where,
P1, P2, P3 and P4 are probabilities of strategy 1, 2, 3 and 4 respectively for
player A.
Q1, Q2, Q3, Q4 and Q5 are probabilities of strategy 1, 2, 3, 4 and 5
respectively for player B
For both the players, the total probability is 1.
This project's network diagram is usually represented using the Activity on Node (AON)
diagram or Precedence Diagram Method (PDM). Let's start by drawing the network
diagram based on the given activities and their time estimates:

Here's the network diagram:

1-2 (5, 6, 7)
/ \
/ \
1-3 (1, 1, 7) 1-4 (2, 4, 12)
\ /
\ /
\ /
3-5 (1, 1, 1)
\ /
\ /
\ /
2-5 (3, 6, 15)
| |
| |
5-6 (1, 4, 7)
\ /
\/
4-6 (2, 2, 8)
Solution:

1-2 (1, 1, 7)
/ \
/ \
1-3 (1, 4, 7) 1-4 (2, 2, 8)
\ /
\ /
\ /
3-5 (2, 5, 14)
\ /
\ /
\ /
2-5 (1, 1, 1)
| |
| |
5-6 (3, 6, 15)
\ /
\/
4-6 (2, 5, 8)
Solution:
13. The demand for an item is 18,000 units per year. The holding cost per unit time is
Rs. 1.20 and the cost of shortage is Rs. 5.00, the production cost is Rs. 400. Assuming
that replenishment rate is instantaneous, determine the optimal order quantity and
how often to make a production run? And also find the numbers orders per year.
(10marks)

Solution:
14. A manufacturing company purchases 9000 parts of a machine for its annual
requirements, ordering one-month usage at a time. Each part costs Rs. 20. The
ordering cost per order is Rs. 15 and the carrying charges are 15% of the average
inventory per year. You have been assigned to suggest a more economical purchasing
policy for the company. What advice would you offer and how much would it save the
company per year? (10 Marks)

Solution:
15. Automatic car wash facility operates with only one bay. Cars arrive according to a
Poisson process, with mean of 4 cars per hour and may wait in facility’s parking lot if
the bay is busy. If the service time for all cars is constant and equal to 10 minutes,
determine Lq, Ls, Wq and Ws.And also find the Probability of zero arrival in queue.
(10 Marks)

Solution:
16. Given the following information. Arrivals and services follow Poisson process.
Customers arrive at the rate of 8 per hour. Service rate is 10 customers per hour. Then
find
(i) What is the average number of customers waiting for service?
(ii) What is the average time a customer must wait in the queue?
(iii) What is the average time for a customer to be in the system? (10 Marks)
17. Arrivals at a telephone booth are considered to be Poisson with an avg. time 10min
between one arrival and the next. The length of the phone call is assumed to be
distributed exponentially with mean 3 min
(i) Find the average number of persons waiting in the system? and queue?
(ii)What is the prob. that a person arriving at the booth will have to wait in the queue?
(iii) What is the prob. that it will take him more than 10 min altogether to wait for phone
and complete his call?
(iv) Estimate the fraction of the day when the phone will be in use?
Solution:
Solution: