Documentos de Académico
Documentos de Profesional
Documentos de Cultura
AOR-01
ASSIGNMENT BOOKLET
Bachelor's Degree Programme
(BS.c./B.A/B.Com)
OPERATIONS RESEARCH
Valid from 1st January to 31st December 2014
It is mandatory to register for a course before appearing in the TermEnd Examination of the course. Otherwise, your result will not be
declared.
School of Sciences
Indira Gandhi National Open University
Maidan Garhi, New Delhi-110068
(2014)
Dear Student,
Please read the section on assignments in the Programme Guide for Elective Courses that we sent you
after your enrolment. A weightage of 30 per cent, as you are aware, has been earmarked for continuous
evaluation. For this you need to answer one tutor-marked assignment for this course, which is in this
booklet.
Instructions for Formating Your Assignments
Before attempting the assignment please read the following instructions carefully:
1) On top of the first page of your answer sheet, please write the details exactly in the following format :
ROLL NO.:.
NAME:.
ADDRESS:.
..
..
..
COURSE CODE:.
COURSE TITLE:.
ASSIGNMENT NO.:
STUDY CENTRE:...
DATE:..
Q1. Which of the following statements are true and which are false? Give reasons for your answers:
i)
The optimal solution to an integer linear programming problem can be found by rounding off
the optimal solution of its LP relaxation.
ii)
iii)
The total number of possible sequences for processing 5 jobs on 4 machines is 54.
iv)
v)
vi)
vii)
The optimal values of the objectives functions of the primal and dual problems are not same.
viii) For each cell (i, j) in an optimal solution to a transportation problem the value
ix)
x)
Q2. (a)
v j cij xj 0.
For a queuing model M/M/1 : GD//, if the service rate increases, the expected
number of customers in the system decreases.
In the inventory model with finite replenishment rate, if the replenishment rate is equal to
consumption rate, the holding cost is 0.
(20)
Solve, by simplex method, the following linear programming problem:
Minimize Z x1 3x 2 2x 3
subject to:
3x1 x2 2 x3 7
2 x1 4 x2 12
(5)
4 x1 3x2 8 x3 10
x1 , x2 x3 0
(b)
A book binder has one printing press, one binding machine and manuscripts of seven
different books. The time required for performing printing and binding operations for
different printing and binding operations for different books are shown below:
Book:
Printing
Time
(Days)
20
90
80
20
120
15
65
Binding
25
60
75
30
90
35
50
Time
(Days)
(5)
Find the optimum sequence of processing of the jobs that minimises the total time required.
Also compute the optimal time required.
Q3. (a)
Jobs
The time taken in hours by four different machines for completing four different jobs is
given below:
Machines
A
12
30
21
15
II
18
13
31
III
44
30
24
21
IV
23
30
28
14
Find the optimal assignment and the optimal time taken to finish the jobs.
(b)
(5)
Customers arrive at a single window server according to a Poisson distribution with mean 10
minutes, and the service time is exponential with mean 6 minutes per customer. Find the
following:
(i) expected number of customers in the system;
(ii) expected number of customers in the queue;
(iii) variance of the queue length
Q4. (a)
(5)
A particular item has demand of 3000 units per year. The cost of one procurement is Rs. 100
and the holding cost per unit is Rs. 2.40 per year. The replenishment is instantaneous and no
shortages are allowed.
Determine:
(i) the economic order quantity
(ii) the number of orders per year
(iii) the time between orders and
(iv) the optimum cost per year
(b)
(2)
x1 x 2 2
2x1 x 2 6x 3 6
x1 x 2 3x 3 4
x1 , x 2 , x 3 0
(c)
(3)
The jobs, predecessors of the jobs and duration of the jobs, in a project as given below:
Job
A
Immediate
Predecessor (s)
-
Duration
(in days)
15
10
12
16
3x1 x 2 12
3x1 11x 2 66
(5)
Find, an initial basic feasible solution using Vogels approximation method and hence find an
optimum transportation schedule for the following data:
Destination
A
Sources
(b)
10
45
II
15
12
15
III
12
40
25
55
20
Demand (units)
Q6. (a)
An unbiased die is thrown. Let X be the random variable denoting the number appearing on
the throw of the die. Find the random variate X corresponding to 0.55.
(5)
Using the mixed generator
(5)
A diet for a sick person must contain at least 4000 units of vitamins, 50 units of minerals and
1400 calories. Two foods A and B are available at a cost of Rs. 4 and Rs. 3 per unit,
respectively. If one unit of Food A contains 200 units of vitamins, 1 unit of mineral and 40
calories, and one unit of Food B contains 100 units of vitamins, 2 units of minerals and 40
calories. Find, by graphical method, what combination of foods A and B be used to minimise
the cost.
(5)
(b)
In an automobile company, the daily production of scooters varies from 146 to 154,
depending upon the availability of raw material and other conditions, as shown in the chart
below:
Production 146 147 148 149 150 151 152 153 154
per day
Probability 0.04 0.09 0.12 0.14 0.11 0.10 0.20 0.12 0.08
Use the following random numbers
80, 70, 43, 18, 65, 61, 57
To simulate the process to find out the average number of scooters manufactured daily.
Q.8 (a)
(4)
6 x1 4 x2 24
x1 2 x2 6
x2 2
x1 x2 1
x1 , x2 0
(b)
Machine
(c)
(3)
10
12
10
11
12
Activity
Time
1 2
56
1 3
57
24
68
34
78
35
8 10
4 9
9 10
Activity
(3)
(i)
(ii)
Q9. (a)
(4)
Find the sequence that minimizes the total time required to complete the following tasks on
two machines:
Task
II
III
IV
VI
Machine A
12
15
Machine B
12
10
16
Find the total time taken when using this sequence. Also, find the idle time for each machine.
(3)
(b)
The production department for a company requires 7200kg of raw material for manufacturing
particular item per year. It has been estimated that the cost of placing an order is A 72 and the
cost of carrying inventory is 25 percent of the investment in the inventories. The price of raw
material is A 20 per kg. Find the economic order quantity (EOQ), the total cost per unit time
and the cycle time.
(3)
(c)
x y z 40
2x y z 10
x, y,z 0
(4)