Institute of Rural Management Anand

Course Name: Operations Research Programme: PGDM-RM42 and FPM-RM20

Date:16/03/2022 Term- Roll No.

End-Term Examination (Closed Book)

Duration of Exam: 2 Hours Weightage: 40 percent Total Marks: 100

Instructions:
1. Please solve all the question in one excel file. If more than one excel file is found open in
your system, it will be considered as a copy case.
2. It is a closed book examination. Students are not allowed to carry or refer to any book,
notes, PPTs during the examination.

Question 1: Answer the following questions.

A Manufacturing plant is capable of manufacturing two different types of machines for sale. Type 1
machine requires 6 hours of Assembly time, 9 hours of Testing time and 7 hours of Painting Time.
Type 2 machine requires 3 hours of Assembly time, 12 hours of Testing time and 3 hours of
Painting Time. The profit earned from Type 1 Machine by the manufacturer should be at least
$200 and Type 2 Machine at least $327. Assembly time available with the manufacturing plant is
24 hours, testing time available is 48 hours and Painting time available is 27 hours. Find the total
amount the buyer of these machines would be willing to pay to the manufacturer using graphical
method?-20 Marks

2. Charan has applied to three jobs and wishes to prepare his resume specific to the job applied to.
He has eight days available to prepare the resumes. He estimates his probability of success (in
percentage) to be 55+ 3X1, 51 + 4X2, 48+ 6X3 respectively ifX1, X2 and X3 days are allotted to the
three resumes. He wishes to allot the days in such a way to maximize the minimum expected
success estimate. Formulate a linear programming problem for this situation. Find the minimum
expected success estimate and the days allotted. - 20 Marks

3. A software company conducts a job-training program for programmers. Expert programmers are
used as teachers in the program at a ratio of one for every ten trainees. The training program lasts
for one month (Assumption: No. oftrainees multiple of 10). From past experience it has been
found that out of ten trainees hired, only seven complete the program successfully (the
unsuccessful trainees are released). Expert programmers are also needed for ongoing projects and
the company's requirements for the next three months are as follows:

Page 1 of 3
 January:100 February:150 March:200

In addition, the company requires 250 expert programmers by April. There are 130 expert
follows:
programmers available at the beginning of the year. Payroll costs per month are as

Each trainee $ 400

Each expert programmer (programming or teaching) $ 700
Each idle expert programmer $500
Set up the linear programming problem that will produce the minimum cost hiring and training
schedule and meet the company's requirements. -20 Marks

4/Gangu Halwai has received requests for delivering sweets to two different weddings. However,
both weddings happen to be on the same day. Given the limited capacity of his shop, he can serve
exactly one wedding at a time. Both wedding parties have asked to limit the choice of sweets to at
most two types from a menu of three different varieties of sweets viz. Kaaju barfi, Coconut barfi
and Chocolate barfi. Wedding Party 1 requires the sweets to be packed in packets of 6 kg, 8 kg and
n d
4kg of kaaju, coconut and chocolate barfi respectively. Wedding Party 2 requires the sweets to be
packed in packets of 8 kg, 12 kg and 4kg of kaaju, coconut and chocolate barfi respectively. Per
packet profit for kaaju, coconut and chocolate barfi are Rs. 5000, Rs. 7000 and Rs. 3000
respectively. If chosen to be produced, Gangu Halwai can produce 14 packets, 10 packets and 18
packets of kaaju, coconut and chocolate barfi. Assume that whatever is produced will be bought in
entirety by the wedding party. The sweets have to be delivered to the wedding parties with the
help of vehicles from the customers themselves. The capacities of the vehicles for both these
parties are 120 kg and 160 kg respectively. Formulate a mathematical model to maximize the
profit for Gangu Halwai. - 10 Marks

5Consider Linear Programming Problem:

Maximize Z= 5X1+8X2
Subject to:

X1s4

X1-3X2s0

X1, X220

Use Graphical Approach to find the optimum solution. - 6 Marks

Question 2: Specify if the statement is a True or False with explanation.

1. For a non-binding constraint, within the range of feasibility, the same variables will remain
optimal, and their values and the optimal value of the objective function will also remain the same.
State whether True or False with
appropriate justification. -4 Marks

Page 2 of 3
 or a linear
programming problem with three decision variables, if
e simuitanE
coeficients of the objective function such that the sum of percentage of
cnange (increase or
allowaDie
decrease) exceeds 100%, then the original optimai sou
Cnange. State whether True False with
or
appropriate justification. - 4 a s
dmaximization problem, outside the range offeasibility, any additional resource increases tne
oDective function at a decreasing rate. Comment on the appropriateness Or the
o
Marks

4. In available. The LHS value calculated

a s
constraint, the RHS shows the amount of resource
the optimum solution shows the actual amount of resource utilized. The difference between these
using
wO R S - LHS) is a non-negative number and shows the quantum of resource that is unutilized.
his unutilized quantity of resource is called surplus. Comment on the appropriateness of the
statement. -4 Marks

S.Company wants to advertise their product in n different media- TV, newspaper, website, radio and
many others. There is total budget restriction and limit on investment in each media. In this
problem, there will be n decision variables, the objective function will have n terms, and there
would be n number of constraints if non-negativity constraints are ignored. State whether True or

False with appropriate justification-4 marks

6. Consider the following linear programming: Maximizing 5X1+8X2 subject to 4X1+5x2s20;

3x1+2X2s12; X1+2x23, X1, x220. Calculate the number of corner points in the graphical solution.
-4 Marks

Page 3 of 3