Reg. No. : ...........................................

Code No. : 20586 B Sub. Code : SEMA 5 D

B.Sc. (CBCS) DEGREE EXAMINATION, APRIL 2021.

Fifth Semester

Mathematics

Major Elective — OPERATIONS RESEARCH — I

(For those who joined in July 2017 onwards)

Time : Three hours Maximum : 75 marks

PART A — (10 × 1 = 10 marks)

Answer ALL questions.

Choose the correct answer :

1. Cμsk Pmk¨£õkPÒ •uÀ ÷|º©øÓ PõÀ£Sv°À

öÁmiU öPõÒÍÂÀø» GÛÀ ___________.

(A) HuõÁöuõ¸ Pmk¨£õk ÷uøÁ¯ØÓx

(B) \õzv¯©ØÓ wºÁõS®

(C) GÀø»¯ØÓ wºÄ QøhUS®

(D) CøÁ GxÄ® CÀø»

 If two constraints do not intersect in the positive
quadrant of the graph, then ___________.
(a) one of the constraint is redundant
(b) the solution is infeasible
(c) the solution is unbounded
(d) none of these

2. ö£›uõUP¨£mh LPP°ß J¸ Ai¨£øh

\õzv¯©õÚ wºÄ, J¸ EP¢u wºÁõP ©õÖÁuØS
÷uøÁ¯õÚ ©ØÖ® ÷£õx©õÚ {£¢uøÚ
___________. (GÀ»õ j&US®)
(A) z j − c j ≥ 0
(B) z j − c j ≤ 0

(C) z j − cj = 0

(D) z j − c j > 0 (or) z j − c j < 0

A necessary and sufficient condition for a basic

feasible solution to a maximization LPP to be an
optimum is that (for all j) ___________.
(a) z j − cj ≥ 0

(b) z j − cj ≤ 0

(c) z j − cj = 0

(d) z j − c j > 0 (or) z j − c j < 0

Page 2 Code No. : 20586 B

3. m&Pmk¨£õkPÒ ©ØÖ® n&Gvº©øÓ AÀ»õu
©õÔPøÍU öPõsh J¸ •ußø© ö£›uõUP¨£mh
LPP°ß Cμmøh Gߣx ___________.
(A) J¸ ]ÔuõUP¨£mh LPP
(B) n&Pmk¨£õkPÒ ©ØÖ® m&Gvº©øÓ AÀ»õu
©õÔPøÍU öPõshx
(C) ÷uºÄ (A) ©ØÖ® (B) Cμsk®
(D) CøÁ GøÁ²® CÀø»
The dual of the primal maximization LPP having
m constraints and n-non-negatives variables
should ___________.
(a) be a minimization LPP
(b) have n-constraints and m non-negative
variables
(c) both (a) and (b)
(d) none of the above

4. CμmøhUS J¸ GÀø»¯ØÓ wºÄ GÛÀ, Auß

•ußø©US ___________.
(A) J¸ GÀø»¯ØÓ wºÄ
(B) \õzv¯ªÀ»õu wºÄ
(C) \õzv¯©õÚ wºÄ
(D) CøÁ GøÁ²ªÀø»

Page 3 Code No. : 20586 B

 If dual has an unbounded solution, then primal
has ___________.
(a) an unbounded solution
(b) infeasible solution
(c) a feasible solution
(d) none of the above

5. J¸ Ch©õØÖuÀ PnUS Gߣx ___________

Ch©õØÖuø» øP¯õÒQÓx.
(A) J¸ JØøÓ¨ ö£õ¸øÍ £» ‰»[Pμ¸¢x
J¸ C»UQØS
(B) £» ö£õ¸øÍ £» ‰»[Pμ¸¢x £»
C»UQØS
(C) J¸ JØøÓ¨ ö£õ¸øÍ £» ‰»[Pμ¸¢x
£» C»UQØS
(D) J¸ JØøÓ¨ ö£õ¸øÍ J¸ ‰»[Pμ¸¢x
The transportation problem deals with the
transportation of ___________.
(a) a single product from several sources to a
destination
(b) a multi-product from several sources to
several destinations
(c) a single product from several sources to
several destinations
(d) a single product from a source to several
destinations

Page 4 Code No. : 20586 B

6. m&‰»[PÒ ©ØÖ® n&C»[SPÒ öPõsh J¸
T.P.°ß wºÄ \õzv¯©õÚx, Auß JxURkPÎß
GsoUøP Gߣx ___________.

(A) m + n – 1 (B) m + n + 1

(C) m + n (D) m×n

The solution to a T.P. with m-sources and

n-destinations is infeasible, if the number of
allocations are ___________.

(a) m+n–1 (b) m+n+1

(c) m+n (d) m×n

7. n-÷Áø»¯õmPÒ ©ØÖ® n -÷Áø»PÒ C¸¢uõÀ,

C¨£i¯õP C¸US® ___________.

(A) n wºÄPÒ (B) n! wºÄPÒ

(C) (n – 1)! wºÄPÒ (D) (n!)n wºÄPÒ

If there are n-workers and n-jobs, there would be

(a) n solutions (b) n! solutions

(c) (n – 1)! solutions (d) (n!)n solutions

Page 5 Code No. : 20586 B

8. J¸ JxURmk PnUS Gߣx ___________ BP
C¸UP•i²®.
(A) T.P. ÷£õ» ÁiÁø©¨¦ ©ØÖ® wºÄ
(B) ö£›uõUP •øÓ
(C) {øμ ©ØÖ® {μÀPÎß GsoUøP \©©õP
C¸¢uõÀ ©mk÷© wºÄ
(D) ÷©ØPsh AøÚzx®
An assignment problem can be ___________.
(a) designed and solved as a transportation
problem
(b) of maximization type
(c) solved only if number of rows equals the
number of columns
(d) all of the above

9. n-÷Áø»PÒ ©ØÖ® Cμsk C¯¢vμ[PÎÀ, (A

©ØÖ® B GßP) Á›ø\•øÓ PnUSPÒ CvÀ
ö\¯»õUP Á›ø\ Gߣx AB BS®.
(A) C¯¢vμ® B°À SøÓ¢u£m\ ÷|μ® öPõsh
÷Áø» •u¼À ö\¯»õUP¨£kQÓx
(B) C¯¢vμ® A°À SøÓ¢u£m\ ÷|μ® öPõsh
÷Áø» CÖv°À ö\¯»õUP¨£kQÓx
(C) C¯¢vμ® B°À SøÓ¢u£m\ ÷|μ® öPõsh
÷Áø» CÖv°À ö\¯»õUP¨£kQÓx
(D) C¯¢vμ® B°À AvP£m\ ÷|μ® öPõsh
÷Áø» CÖv°À ö\¯»õUP¨£kQÓx

Page 6 Code No. : 20586 B

 In ‘n’ jobs are two machines, say A and B,
sequencing problems in which the order of
processing is AB
(a) job having minimum time on machine B is
processed first
(b) job having minimum time on machine A is
processed in the last
(c) job having minimum time on machine B is
processed in the last
(d) job having maximum time on machine B is
processed in the last

10. n&C¯¢vμ[PÎÀ Cμsk ÷Áø»PøÍ

ö\¯»õUSÁx öuõhº£õÚ Á›ø\ •øÓU PnUSPÒ
___________.
(A) Áøμ£h •øÓ°» wºUP •i²®
(B) Áøμ£h •øÓ°» wºUP •i¯õx
(C) Cμsk ÷Áø»PÎß ö\¯õ»UP® Psi¨£õP
J÷μ Á›ø\ öPõsh {£¢uøÚ¯õP C¸US®
(D) ÷©ØPsh GxÄ® CÀø»
Sequencing problems involving processing of two
jobs on ‘n’ machines ___________.
(a) can be solved graphically
(b) cannot be solved graphically
(c) have a condition that the processing of two
jobs must be the same order
(d) none of the above

Page 7 Code No. : 20586 B

 PART B — (5 × 5 = 25 marks)

Answer ALL questions, choosing either (a) or (b).

11. (A) ¤ßÁ¸® LP&I Áøμ£h •øÓø¯

£¯ß£kzv wºUP :
]ÔuõUP¨£mh z = 20x1 + 40x 2

Pmk¨£õkPÐUS Em£mh
3x1 + 6x 2 ≥ 108
3x1 + 12x 2 ≥ 36
20x1 + 10 x 2 ≥ 100
©ØÖ® x1 , x 2 ≥ 0 .

Solve the following linear problem by using

graphical method :
Minimize z = 20x1 + 40x 2

Subject to the constraints :

3x1 + 6x 2 ≥ 108
3x1 + 12x 2 ≥ 36
20x1 + 10 x 2 ≥ 100
and x1 , x 2 ≥ 0 .

Or

Page 8 Code No. : 20586 B

 (B) RÌUPsh LPP&I Áøμ£h •øÓ°À wºUP.
ö£›uõUP¨£mh z = x1 + x 2
Pmk¨£õkPÐUS Em£mh
x1 + x 2 ≤ 1
− 3x 2 + x 2 ≥ 3
x ≥ 0, x 2 ≥ 0 .
Solve the following LPP by graphical
method :
Maximize z = x1 + x 2
Subject to the constraints :
x1 + x 2 ≤ 1
− 3x 2 + x 2 ≥ 3
x ≥ 0, x 2 ≥ 0 .

12. (A) RÌUPsh LPP&UPõÚ Cμmøhø¯ GÊxP.

]ÔuõUP¨£mh z = 3x1 − 2x 2 + 4 x3
Pmk¨£õkPÐUS Em£mh :
3x1 + 5x 2 + 4 x 3 ≥ 7
6x1 + x 2 + 3x 3 ≥ 4
7x1 − 2x 2 − x 3 ≤ 10
x1 − 2x 2 + 5x 3 ≥ 3
4 x1 + 7x 2 − 2x 3 ≥ 2
x1 ≥ 0, x x ≥ 0, x 3 ≥ 0 .

Page 9 Code No. : 20586 B

 Write the dual of the following LPP :
Minimize z = 3x1 − 2x 2 + 4 x3
Subject to the constraints :
3x1 + 5x 2 + 4 x 3 ≥ 7
6x1 + x 2 + 3x 3 ≥ 4
7x1 − 2x 2 − x 3 ≤ 10
x1 − 2x 2 + 5x 3 ≥ 3
4 x1 + 7x 2 − 2x 3 ≥ 2
x1 ≥ 0, x x ≥ 0, x 3 ≥ 0 .
Or
(B) RÌUPsh LPP&I Cμmøh ]®¤ÍUì
•øÓ°À wºUP.
]ÔuõUP¨£mh z = 3x1 + x 2
Pmk¨£õkPÐUS Em£mh :
x1 + x 2 ≥ 1
2x1 + 3x 2 ≥ 2
x1 ≥ 0 , x 2 ≥ 0 .
Use dual simplex method to solve the
following LPP :
Minimize z = 3x1 + x 2
Subject to the constraints :
x1 + x 2 ≥ 1
2x1 + 3x 2 ≥ 2
x1 ≥ 0 , x 2 ≥ 0 .

Page 10 Code No. : 20586 B

13. (A) RÌUPsh T.P.&°ß öuõhUP Ai¨£øh
\õzv¯ wºÂøÚ Ao ]ÔuõÚ •øÓ°À
ö£ÖP.
D1 D2 D3 D4 C¸¨¦
O1 1 2 3 4 6
O2 4 3 2 0 8
O3 0 2 2 1 10
÷uøÁ 4 6 8 6

Obtain an initial basic feasible solution to

the following T.P. using the matrix minima
method.
D1 D2 D3 D4 Capacity
O1 1 2 3 4 6
O2 4 3 2 0 8
O3 0 2 2 1 10
Demand 4 6 8 6

Or
(B) RÌUPsh T.P.&°ß öuõhUP Ai¨£øh
\õzv¯ wºÂøÚ Vogel’s ÷uõμõ¯ •øÓø¯¨
£¯ß£kzv PõsP.
D1 D2 D3 D4 Aئ
S1 20 25 28 31 200
S2 32 28 32 41 180
S3 18 35 24 32 110
÷uøÁ 150 40 180 170

Page 11 Code No. : 20586 B

 Find an initial basic feasible solution to the
following T.P. using Vogel’s approximation
method.
D1 D2 D3 D4 Supply
S1 20 25 28 31 200
S2 32 28 32 41 180
S3 18 35 24 32 110
Demand 150 40 180 170

14. (A) RÌUPsh ChJxURmk PnUQøÚ PÁÚzvÀ

öPõÒP.
÷Áø»¯õmPÒ
W X Y Z
A 8 7 9 10
÷Áø»PÒ B 7 9 9 8
C 10 8 7 11
D 10 6 8 7
ö\¯»õUP ö©õzu ö\»Ä SøÓ¢u£m\©õP
C¸US®£i¯õÚ ÷Áø»¯õmPÎß ÷Áø»
JxURmøhU PõsP.
Consider the following assignment problem :
Workers
W X Y Z
A 8 7 9 10
Jobs B 7 9 9 8
C 10 8 7 11
D 10 6 8 7
Find an allocation of jobs to the workers so
that the total cost processing is minimum.
Or

Page 12 Code No. : 20586 B

 (B) RÌUPsh JxURmk PnUQøÚz wºUP.
A B C D
1 10 25 15 20
2 15 30 5 15
3 35 20 12 24
4 17 25 24 20

Solve the following assignment problem :

A B C D
1 10 25 15 20
2 15 30 5 15
3 35 20 12 24
4 17 25 24 20

15.(A) RÌUPsh uPÁÀPÒ C¯¢vμ[PÎß «uõÚ

ö©õzu ö\¯»õUP ÷|μ®, ©o÷|μ[PÎÀ
ÁÇ[P¨£kQÓx, ©ØÖ® Ph¢x ö\ÀÁx
AÝ©v°Àø» GßÓ Ai¨£øh°À
C¸UQÓx GÛÀ SøÓ¢u£m\ ö©õzu
÷|μzøuU öPõsh ÷Áø»PÎß EP¢u
Á›ø\°øÚU PshÔP.
÷Áø» : A B C D E F G
C¯¢vμ® M1 : 3 8 7 4 9 8 7
C¯¢vμ® M2 : 4 3 2 5 1 4 3
C¯¢vμ® M3 : 6 7 5 11 5 6 12
Page 13 Code No. : 20586 B
 Determine the optimal sequence of jobs that
minimizes the total elapsed time based on
the following information processing time on
machines is given in hours and passing is not
allowed :
Job : A B C D E F G
Machine M1 : 3 8 7 4 9 8 7
Machine M2 : 4 3 2 5 1 4 3
Machine M3 : 6 7 5 11 5 6 12

Or
(B) Áøμ£h •øÓø¯ E£÷¯õQzx, Põmh¨£mh
C¯¢vμ[PÎÀ ¤ßÁ¸® ÷Áø»PøÍa
ö\¯»õUSÁuØPõP ÷\ºUP¨£mh ÷|μzøu
SøÓUPÄ®, AuõÁx JÆöÁõ¸ C¯¢vμ•®
•u¼À ö\´¯ ÷Ási¯ ÷Áø»ø¯U
PshԯĮ. ÷©¾®, Cμsk ÷Áø»PøͲ®
•ÊÁx©õP ö\´x •iUP ÷uøÁ¨£k®
ö©õzu ÷|μzvøÚ²® PnUQkP.
÷Áø» 1 Á›ø\ : A B C D E
÷|μ® : 3 4 2 6 2
÷Áø» 2 Á›ø\ : B C A D E
÷|μ® : 5 4 3 2 6

Page 14 Code No. : 20586 B

 Use graphical method to minimize the time
added to process the following jobs on the
machines shown, (ie) for each machine find
the job which should be done first. Also
calculate the total time elapsed to complete
both the jobs :
Job 1 Sequence : A B C D E
Time : 3 4 2 6 2
Job 2 Sequence : B C A D E
Time : 5 4 3 2 6
PART C — (5 × 8 = 40 marks)
Answer ALL questions, choosing either (a) or (b).
16. (A) Simplex •øÓø¯¨ £¯ß£kzv RÌUPsh
LPP&ø¯z wºUP :
ö£›uõUP¨£mh z = 4 x1 + 10 x 2
Pmk¨£õkPÐUSm£mhx :
2x1 + x 2 ≤ 50
2x1 + 5x 2 ≤ 100
2x1 + 3x 2 ≤ 9
x1 , x 2 ≥ 0 .
Use Simplex method to solve the following
LPP :
Maximize z = 4 x1 + 10 x 2
Subject to the constraints :
2x1 + x 2 ≤ 50
2x1 + 5x 2 ≤ 100
2x1 + 3x 2 ≤ 9
x1 , x 2 ≥ 0
Or
Page 15 Code No. : 20586 B
 (B) Big-M •øÓø¯¨ £¯ß£kzv,
ö£›uõUP¨£mh z = 3x1 + 2x 2
Pmk¨£õkPÐUSm£mhx :
2x1 + x 2 ≤ 2
3x1 + 4 x 2 ≥ 12
x1 , x 2 ≥ 0 .

Use Big-M Method to

Maximize z = 3x1 + 2x 2

Subject to the constraints :

2x1 + x 2 ≤ 2
3x1 + 4 x 2 ≥ 12
x1 , x 2 ≥ 0 .

17. (A) Cμmøh •øÓø¯¨ £¯ß£kzv RÌUPsh

¤ßÁ¸® LPP&ø¯ wºUP.
ö£›uõUP¨£mh z = 2x1 + x 2

Pmk¨£õkPÐUSm£mhx :
x1 + 2x 2 ≤ 10
x1 + x 2 ≤ 6
x1 − x 2 ≤ 2
x1 − 2x 2 ≤ 1
x1 , x 2 ≥ 0 .

Page 16 Code No. : 20586 B

Use duality to solve the following LPP:
Maximize z = 2x1 + x 2
Subject to the constraints :
x1 + 2x 2 ≤ 10
x1 + x 2 ≤ 6
x1 − x 2 ≤ 2
x1 − 2x 2 ≤ 1
x1 , x 2 ≥ 0 .
Or
(B) ¤ßÁ¸® LPP&I Cμmøh simplex •øÓ°À
wºUP.
]ÔuõUP¨£mh z = 10x1 + 6x 2 + 2x3
Pmk¨£õkPÐUSm£mhx :
− x1 + x 2 + x 2 ≥ 1
3x1 + x 2 − x3 ≥ 2
x1 , x 2 , x3 ≥ 0 .
The dual simplex method to solve the
following LPP.
Minimize z = 10x1 + 6x 2 + 2x3
Subject to the constraints :
− x1 + x 2 + x 2 ≥ 1
3x1 + x 2 − x3 ≥ 2
x1 , x 2 , x3 ≥ 0 .

Page 17 Code No. : 20586 B

18. (A) ¤ßÁ¸® Ch ©õØÖuÀ PnUQøÚz wºUP.
B쮣® C»US C¸¨¦
D1 D2 D3 D4
O1 1 2 1 4 30
O2 3 3 2 1 50
O3 4 2 5 9 20
÷uøÁ 20 40 30 10
Solve the following transportation problem :
Origin Destination Available
D1 D2 D3 D4
O1 1 2 1 4 30
O2 3 3 2 1 50
O3 4 2 5 9 20
Required 20 40 30 10
Or
(B) x13 = 50 AÍÄPÒ, x14 = 20 AÍÄPÒ, x 21 =
55 AÍÄPÒ, x31 = 30 AÍÄPÒ, x32 = 35
AÍÄPÒ, ©ØÖ® x34 = 25 AÍÄPÒ GߣøÁ
öPõkUP¨£mkÒÍx. CøÁ T.P. °ß EP¢u
wºÁõ :
AÍÄPÎß C¸¨¦
6 1 9 3 70
11 5 2 8 55
10 12 4 7 90
÷uøÁ¯õÚ 85 35 50 45
AÍÄPÒ
CÀø»ö¯ÛÀ, AuøÚ ]Ó¢u \õzv¯©õÚ
wºÁõP ©õØÖP.
Page 18 Code No. : 20586 B
 Given x13 = 50 units, x14 = 20 units, x 21 =
55 units, x31 = 30 units, x32 = 35 units and
x34 = 25 units. Is it an optimal solution to
the transportation problem :
Available units
6 1 9 3 70
11 5 2 8 55
10 12 4 7 90
Required units 85 35 50 45
If not, modify it to obtain a better feasible
solution.
19. (A) ¤ßÁ¸® PnUQØS EP¢u JxURmiøÚ
PõsP.
E F G H
A 18 26 17 11
B 13 28 14 26
C 38 19 18 15
D 19 26 24 10
Find optimal assignment to the following
problem.
E F G H
A 18 26 17 11
B 13 28 14 26
C 38 19 18 15
D 19 26 24 10
Or

Page 19 Code No. : 20586 B

 (B) ¤ßÁ¸® JxURmk PnUQØS EP¢u
JxURmk AmhÁønø¯U PõsP.
A B C D
1 5 3 2 8
2 7 9 2 6
3 6 4 5 7
4 5 7 7 8
Determine the optimum assignment
schedule for the following assignment
problem.
A B C D
1 5 3 2 8
2 7 9 2 6
3 6 4 5 7
4 5 7 7 8

20. (A) J¸ Bø»°À, BÖ ÷Áø»PÒ ö\´¯

÷Ási²ÒÍx. AøÁ JÆöÁõßÖ® Cμsk
C¯¢vμ[PÒ A ©ØÖ® B, A, B GßÓ
Á›ø\°À, ÁÈ÷¯ ö\À» ÷Ásk®. A¢u
÷Áø»PÎß ö\¯»õUP ÷|μ[PÒ (©o
÷|μ[PÎÀ) C[÷P öPõkUP¨£mkÒÍx.
}[PÒ ö©õzu ÷|μzøu T SøÓ¢x
ö\¯»õUP® |øhö£Ó ÷uøÁ¯õÚ
÷Áø»PÎß Á›ø\ø¯U PõsP. Tß
©v¨¤øÚU PõsP.
÷Áø» : J1 J2 J3 J4 J5 J6
C¯¢vμ® A : 1 3 8 5 6 3
C¯¢vμ® B : 5 6 3 2 2 10

Page 20 Code No. : 20586 B

 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 time (in hours) for the jobs are
given here. You are required to determine
the sequence for performing the jobs that
would minimize the total elapsed time, T.
What is the value of T?
Job : J1 J2 J3 J4 J5 J6
Machine A : 1 3 8 5 6 3
Machine B : 5 6 3 2 2 10

Or
(B) RÌUPsh ÷Áø»PÒ ‰ßÖ C¯¢vμ[PÎÀ
ABC Á›ø\°À ö\¯»õUP¨£kQÓx, GÛÀ
ö©õzu ÷|μzvøÚU SøÓ¨£uØPõÚ
÷Áø»PÎß Á›ø\ø¯U PõsP.
ö\¯»õUP ÷|μ® (©o ÷|μ[PÎÀ) ÷Áø»
1 2 3 4 5 6
C¯¢vμ® A 8 3 7 2 5 1
C¯¢vμ® B 3 4 5 2 1 6
C¯¢vμ® C 8 7 6 9 10 9

Page 21 Code No. : 20586 B

 Find the sequence that minimizes the total
time required in performing the following
jobs on three machines in the order ABC :
Processing Time (in hours) on Job

1 2 3 4 5 6

Machine A 8 3 7 2 5 1

Machine B 3 4 5 2 1 6

Machine C 8 7 6 9 10 9

———————

Page 22 Code No. : 20586 B