No.

of Printed Pages : 14 AOR-01

BACHELOR’S DEGREE PROGRAMME (BDP)

Term-End Examination
December, 2022

(APPLICATION ORIENTED COURSE)

AOR-01 : OPERATIONS RESEARCH

Time : 2 hours Maximum Marks : 50

(Weightage : 70%)

Note : Question no. 1 is compulsory. Answer any four

questions out of Questions No. 2 to 7. Use of
calculators are not allowed.

1. Which of the following statements are True and

which are False ? Give a short proof or a
counter-example in support of your answer. 52=10

(a) x1 = 1, x2 = 2 and x3 = 1 is a basic feasible

solution for the system of equations

x1 + x2 + x3 = 4 and 2x1 + x2 + x3 = 5.

(b) In order to shorten a project completion

time, we must reduce the duration of
non-critical activities.

AOR-01 1 P.T.O.
 (c) The transportation problem is balanced, if
the number of sources matches with the
number of destinations.

(d) Economic Order Quantity (EOQ) results in

minimization of set-up cost.

(e) Little’s formula relates the waiting time of a

customer and the number of customers
present in a service facility.

2. (a) The following is the optimal table of a

maximising LPP where x3, x4 and x5 are
stack variables.

3 5 0 0 0
PB Basics Solution
Variables
x1 x2 x3 x4 x5

1 2
3 x1 1 0 0 – 2
3 3
2 4
0 x4 0 0 – 1 0
3 3

5 x2 0 1 0 0 1 6

0 0 –1 0 –3 36

Suppose a new constraint 2x1 + x2  8 is

added to the LPP. Find the new optimal
solution of the resulting LPP. 5

AOR-01 2
 (b) Find the optimum integer solution to the
following LPP : 5
Maximize z = x1 + 4x2

subject to the constraints :

2x1 + 4x2  7
5x1 + 3x2  15
x1, x2  0 and are integers.

3. (a) Use two-phase simplex method to solve, 5

Maximize z = 6x1 + 4x2
subject to the constraints :
2x1 + 3x2  30
3x1 + 2x2  24
x1 + x2  3,
x1  0, x2  0.

(b) Use Vogel’s Approximation Method to obtain

an initial feasible solution of the following
transportation problem :
D E F G Available
A 11 13 17 14  250
 
B 16 18 14 10  300
 
C 21 24 13 10  400
Demand 200 225 275 250
Also, find the optimal solution. 5

AOR-01 3 P.T.O.
4. (a) Consider the problem of assigning five jobs
to five persons. The profits obtained are
given below :
1 2 3 4 5
A 8 4 2 6 1
 
B 0 9 3 5 4
 
C 3 8 9 2 6
 
D 4 3 1 0 3
E 9 5 8 9 5 
Determine the optimum assignment schedule
that maximizes the profit. 5
(b) Determine the optimal sequence of jobs that
minimizes the total elapsed time based on
the following processing time on the
machines : 5
Job 1 2 3 4 5
Machine A 3 8 7 5 2
Machine B 3 4 2 1 5
Machine C 5 8 10 7 6

5. (a) A manufacturing company purchases

9000 parts of a machine for its annual
requirements, ordering one month usage at a
time. Each part costs < 20. The ordering
cost per order is < 15 and the carrying
charges are 15% of the average inventory for
the year. Suggest a more economical
purchasing policy for the company. How
much would it save the company per year ? 5
AOR-01 4
 (b) On an average, 96 patients per 24 hours
require the service of an emergency clinic.
Also on an average, a patient requires 10
minutes of active attention. Assume that the
facility can handle only one emergency at a
time. Suppose that it costs the clinic < 100

per patient treated to obtain an average

servicing time of 10 minutes, and that each
minute of decrease in the average time
would cost < 10 per patient treated. How

much would have to be budgeted by the

clinic to decrease the average time of the
1 1
queue from 1 patients to a patient ? 5
3 2

6. (a) Use the graphical method to solve the

following LPP : 5
Minimize z = – x1 + 2x2
subject to the constraints :

– x1 + 3x2  10,

x1 + x2  6,

x1 – x2  2, and

x1  0, x2  0.

AOR-01 5 P.T.O.
 (b) Give the dual of the following LPP : 5
Minimize z = x1 + x2 + x3
subject to the constraints :

x1 – 3x2 + 4x3 = 5,

x1 – 2x2  3,

2x2 – x3  4.

x1, x2  0 and x3 is unrestricted.

7. (a) A small project is composed of seven

activities whose time estimates are given
below :

Activity Estimated duration (in days)

Most
i j Optimistic Pessimistic
Likely
1  2 1 1 7
1  3 1 4 7
1  4 2 2 1
2  5 2 5 14
3  5 1 1 1
4  6 2 5 8
5  6 3 6 15

Draw the project network. Find the critical

path and duration of the project. 6

AOR-01 6
 (b) An investment company wants to study the
investment proposals based on the profit
factor. While analysing a new investment
proposal, the company estimated the
probability distribution for the profit as
follows :

Profit
3 5 7 9 10
(in thousands)

Probability 0·1 0·2 0·4 0·2 0·1

Using the random numbers :

19, 7, 90, 2, 57, 28
simulate the profit of the company for six
trials. 4

AOR-01 7 P.T.O.
 E.Amo.Ama.-01

ñZmVH$ Cnm{Y H$m`©H«$_ (~r.S>r.nr.)

gÌm§V narjm
{Xgå~a, 2022

(ì`dhma_ybH$ nmR>²`H«$_)
E.Amo.Ama.-01 : g§{H«$`m {dkmZ
g_` : 2 KÊQ>o A{YH$V_ A§H$ : 50
(Hw$b H$m : 70%)$
ZmoQ> : àíZ g§. 1 H$aZm A{Zdm`© h¡ & àíZ g§. 2 go 7 _| go {H$Ýht
Mma àíZm| Ho$ CÎma Xr{OE & H¡$ëHw$boQ>am| H$m à`moJ H$aZo H$s
AZw_{V Zht h¡ &

1. {ZåZ{b{IV _| go H$m¡Z-go H$WZ gË` h¢ Am¡a H$m¡Z-go

AgË` h¢ ? AnZo CÎma Ho$ nj _| g§{jßV Cnn{Îm `m
àË`wXmhaU Xr{OE & 52=10

(H$) g_rH$aU {ZH$m` x1 + x2 + x3 = 4 Am¡a

2x1 + x2 + x3 = 5 Ho$ {bE x1 = 1, x2 = 2 Am¡a
x3 = 1 EH$ AmYmar gwg§JV hb h¡ &
(I) n[a`moOZm H$mo nyam H$aZo _| bJZo dmbo g_` H$mo H$_
H$aZo Ho$ {bE h_| AH«$m§{VH$ J{V{d{Y`m| H$s Ad{Y`m|
_| H$_r H$aZr Mm{hE &
AOR-01 8
 (J) EH$ n[adhZ g_ñ`m g§Vw{bV h¡ `{X òmoVm| H$s g§»`m,
J§Vì`m| H$s g§»`m go {_bVr h¡ &
(K) BîQ>V_ AmS>©a _mÌm (EOQ) Ho$ H$maU ñWmnZm bmJV
H$m Ý`yZV_rH$aU hmoVm h¡ &
(L>) {bQ>b gyÌ J«mhH$ Ho$ àVrjm-H$mb Am¡a godm-gw{dYm _|
{dÚ_mZ J«mhH$m| H$s g§»`m H$mo g§~Õ H$aVm h¡ &

2. (H$) EH$ A{YH$V_rH$aU H$aZo dmbr LPP H$s BîQ>V_

gmaUr ZrMo Xr JB© h¡ Ohm± x3, x4 Am¡a x5 Ý`yZVmnaH$
(ñQ>¡H$) Ma h¢ &

3 5 0 0 0
AmYmar
PB hb
Ma x1 x2 x3 x4 x5

1 2
3 x1 1 0 0 – 2
3 3
2 4
0 x4 0 0 – 1 0
3 3

5 x2 0 1 0 0 1 6

0 0 –1 0 –3 36

_mZ br{OE LPP _| EH$ Z`m ì`damoY 2x1 + x2  8

Omo‹S> {X`m OmE, V~ àmá hmoZo dmbr LPP H$m Z`m
BîQ>_V hb kmV H$s{OE & 5

AOR-01 9 P.T.O.
 (I) {ZåZ{b{IV LPP H$m BîQ>V_ nyUmªH$ hb kmV H$s{OE : 5
z = x1 + 4x2 H$m A{YH$V_rH$aÊm H$s{OE
O~{H$
2x1 + 4x2  7
5x1 + 3x2  15
x1, x2  0 Am¡a nyUmªH$ h¢ &

3. (H$) {Û-MaU EH$Ym {d{Y H$m à`moJ H$aHo$ {ZåZ{b{IV

LPP hb H$s{OE : 5
z = 6x1 + 4x2 H$m A{YH$V_rH$aÊm H$s{OE
O~{H$
2x1 + 3x2  30
3x1 + 2x2  24
x1 + x2  3,
x1  0, x2  0.

(I) dmoJb g{ÞH$Q>Z {d{Y Ûmam {ZåZ{b{IV n[adhZ

g_ñ`m H$m àmapå^H$ gwg§JV hb kmV H$s{OE :
D E F G CnbãYVm
A 11 13 17 14  250
 
B 16 18 14 10  300
 
C 21 24 13 10  400
_m± J 200 225 275 250

Bï>V_ hb ^r kmV H$s{OE & 5

AOR-01 10
4. (H$) nm±M Om°~m| H$m nm±M AmX{_`m| _| {Z`VZ H$s g_ñ`m
br{OE & bm^ ZrMo {X`m J`m h¡ :
1 2 3 4 5
A 8 4 2 6 1
 
B 0 9 3 5 4
 
C 3 8 9 2 6
 
D 4 3 1 0 3
E 9 5 8 9 5 

bm^ H$m A{YH$V_rH$aU H$aZo Ho$ {bE BîQ>V_ {Z`VZ

{ZYm©[aV H$s{OE & 5

(I) Om°~ H$m dh BîQ>V_ AZwH«$_ kmV H$s{OE Omo

{ZåZ{b{IV _erZm| na àH«$_ H$mb _| ì`VrV g_` H$mo
Ý`yZV_ H$ao : 5
Om°~ 1 2 3 4 5
_erZ A 3 8 7 5 2
_erZ B 3 4 2 1 5
_erZ C 5 8 10 7 6

5. (H$) EH$ {Z_m©Vm H§$nZr AnZr dm{f©H$ Amdí`H$Vm Ho$ {bE

EH$ _erZ Ho$ 9000 nwO©o IarXVr h¡ Am¡a EH$ g_` na
EH$ _mg H$m AmS>©a H$aVr h¡ & àË`oH$ nwO©o H$s bmJV
< 20 h¡ & à{V AmS>©a, AmS>©a bmJV < 15 h¡ Am¡a
aI-aImd bmJV Am¡gV _mbgyMr à{V df© H$s 15%
h¡ & H$ånZr Ho$ {bE A{YH$ Am{W©H$ IarX `moOZm
~VmBE & Bggo H$ånZr à{V df© {H$VZm ~Mm nmEJr ? 5

AOR-01 11 P.T.O.
 (I) EH$ AmnmVH$mbrZ pŠb{ZH$ H$s godm Am¡gVZ 96 amoJr
à{V 24 K§Q>o Ho$ {bE h¡ & Am¡gVZ EH$ amoJr H$mo
10 {_ZQ> H$s g{H«$` XoI^mb H$s Amdí`H$Vm h¡ & _mZ
br{OE {H$ AmnmVH$mbrZ pŠb{ZH$ _| Ho$db EH$ amoJr
EH$ g_` _| {b`m Om gH$Vm h¡ & `h ^r _mZ br{OE
{H$ pŠb{ZH$ _| < 100 à{V amoJr bmJV h¡, `{X
Am¡gV godm H$mb 10 {_ZQ> h¡ Am¡a Am¡gV H$mb _|
H$_r hmoZo na à{V {_ZQ> bmJV < 10 à{V amoJr hmoVr h¡
1 1
& n§{º$ H$s Am¡gV b§~mB© H$mo 1 go VH$ nhþ±MmZo
3 2
Ho$ {bE pŠb{ZH$ H$mo Š`m ~OQ> aIZm Mm{hE ? 5

6. (H$) {ZåZ{b{IV LPP H$mo J«m\$s` {d{Y go hb H$s{OE : 5

z = – x1 + 2x2 H$m Ý`yZV_rH$aÊm H$s{OE

O~{H$
– x1 + 3x2  10

x1 + x2  6

x1 – x2  2, Am¡a
x1  0, x2  0.

AOR-01 12
 (I) {ZåZ{b{IV LPP H$s Û¡Vr {b{IE : 5

z = x1 + x2 + x3 H$m Ý`yZV_rH$aÊm H$s{OE

O~{H$,
x1 – 3x2 + 4x3 = 5

x1 – 2x2  3

2x2 – x3  4.

x1, x2  0 Am¡a x3 Aà{V~§{YV h¢ &

7. (H$) EH$ N>moQ>r n[a`moOZm _| 7 J{V{d{Y`m± h¢, {OZH$m

AmH${bV g_` {ZåZ{b{IV gmaUr _| {X`m J`m h¡ :
J{V{d{Y AmH${bV Ad{Y ({XZm| _|)

i j AmemdmXr A{Vg§^m{dV {ZamemdmXr

1  2 1 1 7
1  3 1 4 7
1  4 2 2 1
2  5 2 5 14
3  5 1 1 1
4  6 2 5 8
5  6 3 6 15

n[a`moOZm H$m ZoQ>dH©$ AmaoI ~ZmBE & H«$m§{VH$ nW

Am¡a n[a`moOZm H$m g_` kmV H$s{OE & 6

AOR-01 13 P.T.O.
 (I) EH$ {Zdoe H§$nZr bm^ H$maH$ Ho$ AmYma na {Zdoe
àñVmdm| H$m AÜ``Z H$aZm MmhVr h¡ & ZE {Zdoe
àñVmd H$m {díbofU H$aZo _| H§$nZr Zo bm^ Ho$ {bE
{ZåZ{b{IV àm{`H$Vm ~§Q>Z AmH${bV {H$`m :
bm^ (hOmam| _|) 3 5 7 9 10

àm{`H$Vm 0·1 0·2 0·4 0·2 0·1

`mÑpÀN>H$ g§»`mAm|
19, 7, 90, 2, 57, 28

H$m à`moJ H$aVo hþE N>h à`mgm| Ho$ {bE H§$nZr Ho$ bm^
H$m AZwH$aU H$s{OE & 4

AOR-01 14