Scribd
Upload
134 views2 pages

BSC 3 Year Mathematics Operations Research 2520 May 2021

This document appears to be an exam for a third year Bachelor of Science degree in mathematics. It contains 10 multi-part questions related to operations research topics like linear programming, transportation problems, assignment problems, replacement problems, and inventory management. Students are asked to formulate problems as linear programs, solve them using techniques like the simplex method, determine optimal sequences that minimize costs or time, and offer economic advice on inventory policies.

Uploaded by

naanmuthalvan040
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
134 views2 pages

BSC 3 Year Mathematics Operations Research 2520 May 2021

This document appears to be an exam for a third year Bachelor of Science degree in mathematics. It contains 10 multi-part questions related to operations research topics like linear programming, transportation problems, assignment problems, replacement problems, and inventory management. Students are asked to formulate problems as linear programs, solve them using techniques like the simplex method, determine optimal sequences that minimize costs or time, and offer economic advice on inventory policies.

Uploaded by

naanmuthalvan040
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/ 2

Total No.

of Pages: 2
2520
Register Number
Name of the Candidate:

B.Sc. DEGREE EXAMINATION, May 2021


(MATHEMATICS)
(THIRD YEAR)
(PART- III)
740: OPERATIONS RESEARCH

Time: Three hours Maximum: 100 marks


Answer any FIVE questions (5×20=100)
1. a) Solve graphically Max z  3x1  4 x2 subject to the constraints

4x1  2x2  80, 2x1  5x2  180, x1 , x2  0

b) A firm manufactures two types of products A and B and sells them at a


profit of Rs.200 on type A and Rs.300 on type B. Each product is processed
on two machines G and H .Type A requires one minute of processing time
on G and two minutes on H; type B requires one minute on G and one
minute on H. The machine G is available for not more than 6 hours 40
minutes while machine H is available for 10 hours during any working day.
Formulate the problem as a LPP and find how many products of each type
should the firm produce each day in order to get maximum profit.
2. Solve by simplex method Max z  4 x1  10x2 subject to the constraints
2x1  x2  50, 2x1  5x2  100, 2x1  3x2  90, x1 , x2  0
3. Use two-phase simplex method to maximize z  2 x1  x2  x3 subject to
4 x1  6 x2  3x2  8, 3x1  6 x2  4 x3  1, 2 x1  3x2  5x3  4, x1 , x2 , x3  0
4. Solve the following LPP by dual simplex method Minimize z  x1  x2 subject
2x1  x2  2,  x1  x2  1, x1 , x2  0
5. Determine an initial basic feasible solution to the following transportation
problem using north-west corner rule:
D 1 D2 D3 D4
O1 6 4 1 5 14
O2 8 9 2 7 16 Availability
O3 4 3 6 2 5
6 10 15 4 35
Requirement
Where Oi and Dj represent ith origin and jth destination respectively.
2520
2
6. A project work consists of four major jobs which four contractions have
submitted tenders. The tender amounts quoted in lakhs of rupees are given in
the matrix:
Jobs

J1 J2 J3 J4

C1 10 24 30 15
C2 16 22 28 12
C3 12 20 32 10
C4 9 26 34 16
Find the assignment which minimizes the total cost of the project. [Each
contractor has to be assigned at least one job].
7. In a factory, there are six jobs to perform, each of which should go through two
machines A and B, in the order A,B. The processing timings(in hours) for the
jobs are given here. Determine the sequence of these jobs that will minimizes
the total elapsed time T.
Job: J1 J2 J3 J4 J5 J6
MA 1 3 8 5 6 3
MB 5 6 3 2 2 10
8. A manufacturing company purchases 9,000 parts of a machine for its annual
requirements, ordering one month usage at a time. Each part cost Rs.20. The
ordering cost per order is Rs.15 and the carrying charges are 15% of the average
inventory per year. You have been assigned to suggest a more economical
purchasing policy for the company. What advice would you offer and how much
would it save the company per year?
9. The data collected in running a machine, the cost of which is Rs. 60,000 are
given below:
Year 1 2 3 4 5
Resale value(Rs) 42,000 30,000 20,400 14,400 9,650
Operating cost(Rs.) 18,000 20,270 22,880 26,700 31,800
Determine the optimum period of replacement of the machine.
10. The cost of a new machine to Rs. 5,000. The maintenance cost of n th year is
given by Cn=500(n-1); n=1,2,….. Suppose that the discount rate per year is 0.5.
After how many years it will be economical to replace the machine by a new
one?

******

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy