Operations Research(15CS653)

Assignment-1

Module- 1

Sl Question Ma Year
No. rks
1a Define Operations Research. List and briefly explain the phases of 08 Dec15
/Jan 16,
operations Research June/July
17
b Solve the following LPP by graphical method 06 Dec15
/Jan 16,
Min Z=20x1 + 10x2
Constraints x1 + 2x2 ≤ 40
3x1 + x2 ≥ 30
4x1 + 3x2 ≥ 60
x1, x2 ≥0
c A farmer has 100 acres of form. He can sell all tomatoes, lettuce or 06 Dec15
/Jan 16,
radishes and can raise the price to obtain Re 1.00 per kg tomatoes, Rs
0.75 ahead for lettuce and Rs. 2.00 per kg for radishes. The average yield
per acre is 2000kg of tomatoes, 3000 heads of lettuce and 1000kgs of
radishes. Fertilizers are available at Rs.0.50 per kg and the amount
required per acre is 100kgs each for tomatoes and lettuce and 50 kgs for
radishes. Labour required for sowing, cultivating and harvesting per acre
is 5 man-days for tomatoes and radishes and 6 man-days for lettuce. A
total of 400 man-days of labour are available at Rs.20.00 per man-day.
Formulate this problem as a linear programming model to maximize the
farmer’s total profit.
2 a. Define the following with reference to linear programming model 10 June/
i) Unbounded solution July 16
ii) Feasible solution
iii) Slack variable
iv) Surplus variable
v) Optimal Solution
b. The whit window company is a company with only 3 employees which 10 June/
makes two different kinds of handcrafted windows a wood framed and an July 16
aluminum framed window. They earn $60 profit for each wood framed
window and $30 profit for each aluminum framed window. Doug makes
the wood frames and can make 6 per day. Linda makes the aluminum
frames and can make 4 per day. Bob forms and cuts the glass and can
make 48 square feet of glass per day. Each wood framed window uses 6
square foot of glass and each aluminum framed windows used 8 square
feet of glass. The company wishes to determine how many windows of
each type to produce per day to it maximize total profit. Formulate it as
LPP and solve graphically.
3 a. What are different phases of operations research? Briefly explain phases 08 Dec 16/
of operations research study. Jan 17

Page 1
 Operations Research(15CS653)

b. Old hens can be bought at Rs. 50/- each but young ones cost Rs. 100/- 06 Dec 16/
each. The old hens lay 3 eggs/week and young ones lay 5 eggs/week. Jan 17
Each egg costs Rs. 2/-. A hen costs Rs. 5/- per week to feed. If a person
has only Rs. 3000/- to spend for hens.Formulate the problem to decide
how many of each kind of hen should he buy ? Assume that he cannot
house more than 50 hens.
c. Define the following with respect to a LPP. Give example for each: 06 Dec 16/
i) Feasible solution Jan 17
ii) Feasible region
iii) Infeasible solution
4 Solve the following LPP by using graphical method: 08 Dec 16/
Maximize Z=5x1 + 4x2 Jan 17
Subject to 6x1 + 4x2 ≤ 24
x1 + 2x2 ≤ 6
-x1 + x2 ≤ 1
x2 ≤ 2
where x1,x2 ≥ 0
5a Define Operations Research. List and briefly explain the phases of 8 Dec15
/Jan 16,
operations Research June/July
17
b A firm can be produced 3 types of body sweaters say A,B and C. Three 5 June/July
17
kinds of wool are required for it, say red wool, green wool and blue
wool. One unit of type A sweater needs 2 yards of red wool and 3 yards
of blue wool, one unit of type B sweater needs 3 yards red wool 2 yards
of green wool and 2 yards of blue wool. One unit of type C sweater
needs 5 yards of green wool and 4 yards of blue wool. The firm has only
a stock of 80 yards of red wool, 100 yards of green wool and 150 yards
blue wool. It is assumed that the income obtained from each unit of type
A sweater is Rs.30, type B sweater is Rs. 50 and type C sweater is Rs.40.
Formulate this problem as LPP.
c Using graphical method solve the following : 7 June/July
17
Maximize Z= 3000x1 + 2000x2
Subject to x1 + 2x2 ≤ 6
2x1 + x2 ≤ 8
x2 ≤ 2
x1 + x2 ≤ 1
and x1, x2 ≥ 0

Page 2
 Operations Research(15CS653)

Module-4
Sl Question Ma Year
No. rks
1a Find an optimal solution after obtaining the IBFS using ‘Vogels 10 Dec 15
Approximation method’. /Jan 16

W1 W2 W3 W4 Capacity
F1 19 30 50 10 07
F2 70 30 40 60 09
F3 40 08 70 20 18
Demand 05 08 07 14 34
b Solve the given Assignment problem, so that the total cost is minimized 10 Dec 15
/Jan 16
M1 M2 M3 M4
J1 05 07 11 06
J2 08 05 09 06
J3 04 07 10 07
J4 10 04 08 03

2a Hindustan construction company needs 3, 3, 4 and 5 million cubic feet of 10 June/

fill at four earthen dams-sites in punjab. It can transfer the fill from three July 16
mounds A,B and C where 2, 6 and 7 million cubic feet of fill is available,
cost of transporting one million cubic feet of fill from mounds to the four
sites in lakhs are given in the table.
Find IBFS by using any method and check for optimality.
To

I II III IV ai
From A 15 10 17 18 2
B 16 13 12 13 6
C 12 17 20 11 7
bl 3 3 4 5
b Five men are available to do five different jobs. From past records the 10 June/
time (in hrs) that each man takes to do each job is known and given in July 16
the following table;
Job
I II III IV V
A 2 9 2 7 1
B 6 8 7 6 1
Man C 4 6 5 3 1
D 4 2 7 3 1
E 5 3 9 5 1

Page 3
 Operations Research(15CS653)

3a Solve the following transportation problem by using i) North- West 10 Dec 16/
corner method ii) Vogel’s approximation method Jan 17
Destination
1 2 3 4 Supply
1 3 1 7 4 300
Source 2 2 6 5 9 400
3 8 3 3 2 500
Demand 250 350 400 200
b Solve the following assignment problem. 10 Dec 16/
Jan 17
Subject
S1 S2 S3 S4
P1 2 10 9 7
P2 15 4 14 8
Professor
P3 13 14 16 11
P4 3 15 13 8
Find the schedule so as to minimize the total subject preparation time for
all subjects.
4a Find the initial basic feasible solution using North West corner rule and 10 June/
Vogel’s approximation method for the following transportation problem July 17

19 30 50 10 7
70 30 40 60 9
40 8 70 20 18
5 8 7 14
b Write the procedure of Hungarian method 05 June/
July 17
c Find the optimal solution to the following assignment problem showing 05 June/
the costs (Rs) for assigning workers to jobs. July 17

Job
W1 18 17 16
Workers W2 15 13 14
W3 19 20 21

Page 4
 Operations Research(15CS653)

Module-5
Sl Question Ma Year
No. rks
1a. Use graphical method to solve the following game 10 Dec15/
B Jan 16,
June/
1 3 11 July
A 8 5 2 17.

2 a Use Tabu search algorithm to find an optimal solution of the following 10 Dec 15
illustration. /Jan 16
Constraint 1: Link AD can be included only if link DE also included.
Constraint 2: At most one of the three links AD,CD and AB can be
included. Charge a penalty of Rs 100 if constraint 1 is violated. Charge a
penalty of Rs.100 if constraint 1 is violated. Charge a penalty of Rs. 100
if two of the three links specified in constraint 2 are included. Increase
this penalty to Rs. 200 if all the three of links are included.

B
20 30

A 30 C 5 E

15 15 40

b Write a brief note on: 10 June/

i) Simulated Annealing July 16
ii) Genetic Algorithm
3a Define the following with reference to game theory with an example 10 June/
i) Pure strategy July 16
ii) Mixed strategy
iii) Saddle point
iv) Pay off matrix
v) 2 person zero sum games
b In a game of matching coins with two players, suppose one player wins 10 June/
Rs. 2 when there are two heads and wins nothing when there are two tails July 16
and loses Rs 1 when there are one head and one tail. Determine the
payoff matrix, the best strategies for each player and the value of the
game.

Page 5
 Operations Research(15CS653)

4 Explain briefly the following 20 June/

a) Tabu search July 16,
Dec 16/
b) Genetic algorithm Jan 17
c) Simulated annealing technique
d) Meta heuristics, advantage and disadvantages
e) Decision trees (June/July 17)
5a Explain following terms with example 06 Dec 16/
i) Saddle point Jan 17
ii) Value of the game
iii) Payoff matrix
b Solve the following game by dominance principle: 07 Dec 16/
Jan 17
Player B
1 2 3 4 5
1 2 5 10 7 2
Player A 2 3 3 6 6 4
3 4 4 8 12 1

c Solve optimally using graphical method by considering the payoff matrix 07 Dec 16/
of player A as shown below Jan 17

Player B
1 2 3 4 5
1 3 6 8 4 4
Player A
2 -7 4 2 10 2

6a Using the dominance concept, obtain the optimal strategies for both the 10 June/
players and determine the value of game. The pay off matrix for player A July 17
is given.
B
I II III IV V
I 2 4 3 8 4
II 5 6 3 7 8
A
III 6 7 9 8 7
IV 4 2 8 4 3

Page 6