0% found this document useful (0 votes)
168 views3 pages

End Sem Exam 2020 - Operation Research

The document provides instructions and questions for an Operations Research exam for a first semester MBA program at Motilal Nehru National Institute of Technology Allahabad. Students are asked to formulate linear programs to optimize advertising strategies and waiter shift schedules. They are also asked to solve provided linear programs using techniques like the simplex method and stepping stone method.

Uploaded by

Utkarsh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
168 views3 pages

End Sem Exam 2020 - Operation Research

The document provides instructions and questions for an Operations Research exam for a first semester MBA program at Motilal Nehru National Institute of Technology Allahabad. Students are asked to formulate linear programs to optimize advertising strategies and waiter shift schedules. They are also asked to solve provided linear programs using techniques like the simplex method and stepping stone method.

Uploaded by

Utkarsh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

मोतीलाल नेहरु राष्ट्रीय प्रोद्यौगिकी संस्थान इलाहबाद

प्रयािराज-211004 (भारत)

Motilal Nehru National Institute of Technology Allahabad


Prayagraj-211004 [India]

End Semester Examination (Odd Semester) 2020-21

Programme Name: MBA Semester: 1st

Course Code: MS41104 Course Name: Operation Research

Branch: Student Reg. No.:

Duration: 2 Hours Max. Marks: 40


Duration to upload pdf: 20 Minute

Instructions:
(i) All questions are compulsory.
(ii) The intended marks is given alongside each question
(iii) Please name the answer pdf file as [Registration Number_Course Code]

Question 1
An advertising company wishes to plan its advertising strategy in three different media i.e. television,
radio and magazine. The purpose of advertising is to reach as large a number of potential customers as
possible. The following data are available:
TV Radio Magazine
Cost of an advertising unit Rs. 30,000 Rs. 20,000 Rs. 25,000
No of potential customers reached per unit 2,00,000 6,00,000 2,50,000
No of female customers reached per unit 1,50,000 4,00,000 1,20,000

The company wants to spend not more than Rs. 4,50,000 on advertisements. The following
requirements must be met:
(i) The number of advertising unit on TV and Radio each should be between 5 and 12.
(ii) At least 10,00,000 exposures take place among female customers.
(iii) Advertising on magazines be limited to Rs. 2,50,000.
(iv) At least 5 advertisement units be bought on magazine.
Formulate the problem into a linear program. [10]
Question 2
a. The following is the average demand for waiters at a 24 hours coffee shop.
Scheduled Hours No of waiters required
Between 00-04 hours 2
04-08 hours 7
08-12 hours 15
12-16 hours 8
16-20 hours 20
20-24 hours 6

According to shift schedules, a waiter may begin his work at midnight, 4, 8, 12, 16 and 20 hours and
work for 8 hours continuously. Formulate the problem as a linear program for the optimal shift plan
requiring minimal number of waiters. [5]

b. Obtain the dual of the following primal LPP


Minimize Z = 3x1 – 2x2 + x3 subject to the constraints

2x1 – 3x2 + x3 ≤ 5

4x1 – 2x2 ≥ 9

-8x1 + 4x2 +3x3 = 8

where x1, x2 ≥ 0 and x3 is unrestricted [5]

Question 3
a. Maximize Z = 2x1 + 4x2 + x3 + x4

Subject to the constraints:

x1 + 3x2 + x4 ≤ 4

2x1 + x2≤ 3

x2 + 4x3 + x4≤ 3

x1, x2, x3, x4 ≥ 0

Solve the above LP using Simplex method. [10]


Question 4
Obtain the optimal solution for the transportation problem shown in tabular form using
stepping stone method. The initial solution (allocation) to the problem is as follows: [10]
cell (AD) →10 cell (BD) → 5 cell (BE) → 20 cell (CE) → 2 cell (CF) → 18

D E F Supply
A 2 1 5 10
B 7 3 4 25
C 6 5 3 20
Demand 15 22 18

You might also like