About this question paper
This is the previous year question paper of Mathematics Operations Research (MSc) (Semester 3) conducted by Hemchand Yadav Vishwavidyalaya, Durg (Dec 2018). Practising it helps you understand the exam pattern, important questions and marks distribution of your university.
How to prepare with this paper
- पूरा पेपर एक बार पढ़ें और जो प्रश्न आपको आते हैं उन पर निशान लगाएँ।
- देखें कि हर प्रश्न सिलेबस की किस इकाई से है — जो इकाइयाँ बार-बार आती हैं, वही सबसे ज़रूरी हैं।
- बिना नोट्स देखे 3 घंटे में पेपर हल करें, फिर अपनी किताब से उत्तर मिलाएँ।
- इसी विषय के दूसरे वर्षों के पेपर भी डाउनलोड करें और दोहराए गए प्रश्न ढूँढें।
Questions in this paper (text version)
यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।
Consider the following network : Code No. : 03/403
2 Third Semester Examination, Dec. 2018
3 v 4 OPERATIONS RESEARCH
type questions which are to be answered in one or two sentences.
five new housing development areas. The figure depicts the
potential linkages among the five areas. The cable miles are shown Part C (Short answer type) of each question will be answered in
200-250 words.
2 3 Part D (Long answer type) of each question should be answered
6 5 within the word limit 400-450.
1 8 Unit - I
Determine the most economical cable network for the company
A project consists of a series of tasks labelled A, B, -----H, I
quality belt and belt B is of lower quality . The respective profits
network diagram having the following constraints: are Rs. 4 and Rs. 3 per belt. Each belt of type A requires twice as
company could make 1000 belts per day. The supply of leather
Find also the minimum time of completion of the project, when
is sufficient for only 800 belts per day. Belt A requires a fancy
the time of completion of each task is as follows:
Time : 23 8 20 16 24 18 19 4 10 buckles available for B. Determine the optimal product mix.
(in days) (12)
(2) Code No. : 03/403 (3) Code No. : 03/403
Use two phase simplex method to maximize
Prove that there always exists an optimum solution to a
transportation problem.
. feasible solution of the transportation problem :
Unit - II
Q.2 A. Write dual of
Minimize A pharmaceutical company is producing a single product and
is selling it through five agencies located in different cities.
1 2 2 3 All of a sudden, there is a demand for the product in another
OR x ≥0 five cities not having any agency of the company. The
Explain parametric changes in b in parametric linear1 1 2 2
company is faced with the problem of deciding on how to
programming. A 11 13 17 14 250
assign the existing agencies to dispatch the product to needy
cities in such a way that the distance is minimised. It is given
Maximize by the table : Deficit cities (12)
1 2 1 2 1 2 1 2 Demand 200 225 275 250
OR Surplus
Consider the parametric linear programming problem: C 75 66 57 114 69
Cities
Maximize D 80 72 60 120 72
1 2 3 1 3 Determine the optimum assignment schedule.
1 2 1 2 3 Unit - IV
Unit - III Q.4 A. Write two applications of the minimal spanning tree problem.(2)
Q.3 A. Write two methods to solve a tansportation problem. (2) Q.4 B. Define dangling by a diagram. (2)