Institute of Rural Management Anand

Course Name: OR Quiz 1 (Open Book) PRM41(2020-22)

Date: 28/11/2020 Term – II Roll No.______________

Name: __________________________________________ Section: ______________

Duration of Exam: 1 Hrs___ _ Total Marks: 30 Weightage: 15 percent

Instructions:

 Write your personal details (i.e. Roll No., Name, and Section) in your answer-sheet.
 Read the question carefully and answer accordingly.
 Clearly specify the question number which you are answering (No need to copy
questions in document).
 Save your word document (answer sheet) containing your final answers as a PDF
file.
 Upload the PDF file to LMS to fully complete your submission.

Answer the following questions.

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

2. For a linear programming problem with three decision variables, if simultaneous

changes are made in two of the coefficients of the objective function such that the
sum of percentage of allowable change (increase or decrease) exceeds 100%, then the
original optimal solution will certainly change. State whether True or False with
appropriate justification. – 4 Marks

3. In a ≤ constraint, the RHS shows the amount of resource available. The LHS value
calculated using the optimum solution shows the actual amount of resource utilized.
The difference between these two (RHS – LHS) is a non-negative number and shows
the quantum of resource that is unutilized. This unutilized quantity of resource is
called surplus. Comment on the appropriateness of the statement. – 4 Mark
4. A 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 – 3 Marks

5. Consider the following linear programming: Maximizing 5X1+8X2 subject to

4X1+5X2≤20; 3X1+2X2≤12; X1+2X2≥3, X1, X2≥0. Calculate the number of corner points
in the graphical solution. – 3 Marks

6. A company has two grades of inspectors, I and II to undertake quality control

inspection. At least 1, 500 pieces must be inspected in an 8-hour day. Grade I inspector
can check 20 pieces in an hour with an accuracy of 96%. Grade II inspector checks 14
pieces an hour with an accuracy of 92%. Wages of grade I inspector are Rs. 5 per hour
while those of grade II inspector are Rs. 4 per hour. Any error made by an inspector
costs Rs. 3 to the company. If there are, in all, 10 grade I inspectors and 15 grade II
inspectors in the company, Formulate LP such that the optimal assignment of
inspectors minimize the daily inspection cost. – 6 Marks

7. Consider Linear Programming Problem:

Maximize Z = 5X1+8X2
Subject to:
X1≤4
X1-3X2≤0
X1, X2≥0
Use Graphical Approach to find the optimum solution. – 6 Marks