2023 2024 EduVark > Education Discussion > Question Papers


  #1  
January 25th, 2016, 09:52 AM
Super Moderator
 
Join Date: Mar 2012
Manonmaniam Sundaranar University Question Papers B.Sc Maths

Can you provide me previous year question paper of Manonmaniam Sundaranar University (MSU) B.Sc Mathematics Operation Research as I need it for preparation?

The previous year question paper of Manonmaniam Sundaranar University (MSU) B.Sc Mathematics Operation Research as I need it for preparation is as follows:

Select the accurate ans. (10X1=10)

1. What is an unbounded solutions?
a. finite number of solutions
b. infinite number of solutions
c. feasible solution
d. infeasible solution.

2. There is a dual constraint for every -------
a. dual variable
b.primal variable
c.primal constraint
d. feasible solution.

3. A basic feasible solutions is optimum if
a.Zj-Cj<0 b. Zj-Cj>0 c. X1,X2,......Xn>0 d. X1,X2,.....<0.

4. Dual simplex method is applicable to the L.P.P having
a. an optimum solution b. an infeasible solution c. an optimum and feasible solution d. an optimum and feasible solution.

5. A transportation issue is stated to be balanced if
a. Total supply > Total demand b. Total supply < Total demand c. Total supply = Total demand=0 d.Total supply = Total demand.

6. The current basic feasible solution of the transportation issue is optimal if
a. 1 Zij-Cij<0 b. all Zij-Cij<0 c. oneZij-Cij>0 d.all Zij-Cij>0

7. In the optimum solution of the assignment problem, a provided row or column of the cost matrix have ----
a. no assignment b. <0assignment c.>2 assignment d. 1 assignment.

8.If Cij > 0 such that minimum Cij =0 then xij provides
a. optimum solution b. feasible solution c. infeasible solution d. unbounded solution.

9. The sequence of jobs and the order of completion of jobs are
a. dependent b. independent c. minimum d. maximum.

10. In graph method the diagonal line segment indicates that
a. no job is under process b.first job is under process c. 2nd job is under process d.both jobs are under process

Ans All Ques. (5x6=30 marks)

11. a. Write the standard form of the linear programming issue.
b.solve graphically: Max Z=3X1+2x2 subject to 2x1+x2<40 x1+x2<24 2x1+3x2<60 x1+x2>0.

12.a. Use penalty method to solve Max Z=3x1+2x2 subject to 2x1+x2 <2 3x1+4x2>12 x1,x2>0

b. Prove that the dual of the dual us primal.

13. a. find an initial basic feasible solution to the following transportation issue using the matrix minima method . D1 D2 D3 D4

01 one two three four 6

02 four three two 0 8

03 0 two two one 10

four six eight 6

b. discuss Vogels approximation method.

14.a. Write Hungarian assignment algorithm.

b. Solve the subsequent assignment problem:
one two three 4

A 10 12 19 11

B five 10 seven 8

C 12 14 13 11

D eight 15 11 9


15.A. determine the sequence for six jobs two machines that will minimise the total elapsed time T.

Processing time (in hours)

job: J1 J2 J3 J4 J5 J6

M1: one three eight five six 3
M2: five six three two two 10

B. using graph method determins the minimum elapsed time sequence of two jobs four machines.

Machines

Job1 Sequence A B C D
Time two four five 1

Job2 Sequence D B A C
Time six four two 3

part C (5X12=60 Marks)

16 a. Use Simplex method to Maximize Z= 5x1+4x2
subject to the constraints 4x1+5x2<10 3x1+2x2<9 8x1+3x2<12 x1,x2>0

b. Use simplex method to maximize Z= 107x1+x2+2x3 subject to the constraints 4x1+5x2<10 16x1+x2-6x3<5 3x1-x2-x3<0 x1,x2,x3,x4>0

17 a. usal dual simplex method to solve Minimize Z=3x1+x2 subject to x1+x2>1 2x1+3x2>2 x1,x2>0b. obtain the optimum integer solution to Maximize Z=x1+x2 subject to 3x1+2x2<5 x2<2 x1,x2>0

18 a.solve the subsequent assignment issue


A B C D E

I three eight two 10 3
II eight seven two nine 7
III six four two seven 5
IV eight four two three 5
V nine 10 six nine 10

B. obtain the optimum assignment and the maximum profit for the following:


A B C D E

I 32 38 42 28 40
II 40 24 28 21 36
III 41 27 33 30 37
IV 22 38 41 36 36
V 29 33 40 35 39

20 a.solve the subsequent sequence issue

Job

one two three four five 6

M1: eight 10 six seven 11 3
M2: five six two three four 4
M3: four nine eight six five 5

B. using grapical method determins the minimum elapsed time sequence of two jobs five machines.

Machines

Job1 Sequence A B C D E
Time three four two six 2

Job2 Sequence B C A B E
Time five four three two six

Last edited by Anuj Bhola; February 12th, 2020 at 10:00 AM.
Similar Threads
Thread
Manonmaniam Sundaranar University in UAE
Manonmaniam Sundaranar University BA English Question Papers
Manonmaniam Sundaranar University
Phd In CSE Manonmaniam Sundaranar University
Manonmaniam Sundaranar University Under UGC
ME course in Manonmaniam Sundaranar University
Manonmaniam Sundaranar University in Coimbatore
Manonmaniam sundaranar university sample question paper
Manonmaniam Sundaranar University BSC Maths Syllabus
Model Question Paper Manonmaniam Sundaranar University
Manonmaniam Sundaranar University DDE
Phd in Manonmaniam Sundaranar University
MBA Manonmaniam Sundaranar University
Manonmaniam Sundaranar University Syllabus for MCA
Manonmaniam sundaranar university BCA question papers



Quick Reply
Your Username: Click here to log in

Message:
Options



All times are GMT +5. The time now is 08:19 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
Content Relevant URLs by vBSEO 3.6.0

1 2 3 4 5 6 7 8