Scribd
Upload
9 views

International: Symbiosis

The document discusses a linear programming problem faced by a pharmaceutical company. The company produces a single product through five agencies located in different cities. There is now additional demand in five new cities without agencies. The company must assign the existing agencies to the new cities to minimize total travel distance based on distances between cities provided in a table.

Uploaded by

waqar.baig2025
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

International: Symbiosis

The document discusses a linear programming problem faced by a pharmaceutical company. The company produces a single product through five agencies located in different cities. There is now additional demand in five new cities without agencies. The company must assign the existing agencies to the new cities to minimize total travel distance based on distances between cities provided in a table.

Uploaded by

waqar.baig2025
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

SYMBIOSISINTERNATIONAL (DEEMEDUNIVERSITY)

(Established under Sectlon 3 of


the UGC Act, 1956 )
Re-accredited by NAAC with 'A++ Grade (3.56/4) Awarded Category -Iby UGC
Seat No.1|66
Institute: (0212)SYMBIOSIS INSTITUTE OF BUSINESSMANAGEMENT, NAGPUR
Programme: (021241) MASTER OF BUSINESS ADMINISTRATION

Batch: 2022-24
Semester:
Course: Operations Research
Course Code: 0212410207

Date: 04/04/2023
Maximum Marks: 40
Day: Tuesday Time: 10:00 -11:30
NOTE: DO NOT WRITE ANYTHING ON THE QUESTION PAPER
Instructions:
1) Students are advised to read the instructions given in Section A &Section B.
2) Students should write the Question Number at the middle- top of the attempted answer and in
the
leftcolumn so that the examiner cannot miss out the evaluation of that attempted question.

Section -A (20 Marks)


(Attempt any One Question from Que. 1&Que. 2. Que. 3.4 &5 are compulsory )
Each Question carries 5 marks (5 Marks * 4 Questions = 20marks)

Q.1 Calculate Five Yearly Weighted Moving Average for the following data. The
weights are 1,1,2,2,3.
Year Production
2001 22
2002 42
2003 47
2004 15
2005 16
2006 35
2007 38
2008 25
2009 40
5 Marks (CO1)

Q.2 Regardless of the way one defines linear programming, certain basic
requirements are necessary before this technique can be employed to business
problems. Explain briefly these basic requirements used in formulation.
5 Marks (C01)

Page 1 of 3
Acompany sells two different products Aand B, making a profit of Rs 40
and Rs
Q.3
common
30 per unit respectively. They are both produced with the help of
production process and are sold in two different markets. The production process
has a total capacity of 30,000 man-hours. It takes three hours to produce a unit of
Aand one hour to produce a unit of B. The market has been surveyed and
company officials feel that the maximum number of units of Athat can be sold is
8,000 units and of Bis 12,000units. Subject to these limitations, products can be
sold in any combination. Formulate the LPP model to maximize the profit.

5 Marks (C02)

Q.4 An assembly is to be made from two parts Xand Y. Both parts must be turned on
a lathe. Y must be polished and x need not be polished. The sequence of activities
with their predecessors is given below:

Activity Description Predecessor activity


A Open work order
B Get material for X A
C Get material for Y A
D Turn Xon lathe B
E Turn Y on lathe B,C
Polish Y
G Assemble Xand Y D, F
Pack G

Draw the network diagram.


5Marks (C03)
0.5 Determine the initial feasible solution using Vogel's Approximation method.
D1 D2: D3 D4 D5 SUPPLY
01 68 35 4 74 15 18
02 57 88 91 3 17
03 91 60 75 45 60 19
04 52 53 24 7 82 13
05 51 18 82 13 7 15
DEMAND 16 18 20 14 14

5 Marks (C04)

Page 2 of 3
Section -B (20 Marks)
(Case-Study - Compulsory)
Q.6 A pharmaceutical company producing a single product sold it through five
agencies situated indifferent cities. All of a sudden there rouse a demand for the
product in another five cities that didn't have any agency of the company. The
company is now facing the problem of deciding on how to assign the existing
agencies in order todispatch the product to needy cities in such a way that the
travelling distance is minimized.

The distance between the surplusand deficit cities in (KM in hundreds) is given
in the following table.

Assign deficit citiestothe surplus cities to minimize the total distance.

Deficit Cities

I II III IV V

A 2 9 2 7 1

B 6 8 7 6 1
Surplus
Cities 4 6 5 3 1

D 4 2 7 3 1

E 5 3 9 5 1

20 Marks (C04)

You might also like