HOLY CROSS COLLEGE (AUTONOMOUS), TIRUCHIRAPPALLI-620002

DEPARTMENT OF MATHEMATICS
III B.Sc.MATHEMATICS (SHIFT I & II) SEMESTER V - II INTERNAL TEST: OCTOBER 2015
MAJOR CORE 10 : OPTIMIZATION TECHNIQUES I
Code: U08MA5MCT12
Time:2 Hours

Max. Marks:50
SECTION A
ANSWER ALL THE QUESTIONS:

10 x 1 =10

Choose the correct answer:

1.

In Big M method , coefficient of an artificial variable in the objective function

a)+M
b) M
c) +1
d) 0

2. The cost matrix of a balanced assignment problem will be

a) unit matrix
b) rectangular matrix
c) square matrix d) scalar matrix
3. The number of possible sequences with m machines and n jobs is
n
a) (m!)

4.

2 c 3 (k r)
c 1kr

b)

2c 3(kr )
c 1(k r )

(n!)m

c) n!

d) m!

Match the following time in sequencing problem with a suitable term and choose the correct answer.
1. Time between completion of last job and

A) Waiting time

beginning of the first job

2 c 3 (C 1+C 2)
Dc1 C 2

2 c 1 c 3 DC 2

Total elapsed time

(C 1+C 2)
2 c 3 (C 1+C 2)
processing time
Dc1 C 2

2. Time in shifting a job from M1 M2

B)

3. Time before the start of the next job

C)

in the sequence
4. Time before entering into the next machine

D) Negligible

2 c 3 DC 2
c 1(c 1+C 2)
E) Idle time
a)1C, 2D, 3B, 4E

b) 1B, 2D, 3E, 4A

c) 1D, 2C, 3B, 4A

c 3 DC 2
2 c 1( c 1+C 2)

d) 1B, 2D, 3A, 4C

5. Of the following pair of statements one is an assertion and the other is a possible reason. Read the
statements carefully and mark your answer according to the key given.
Assertion : Travelling Salesman Problem is a special case of Assignment Problem
Reason : In a Travelling Salesman Problem a salesman has to plan his tour on a 1-1 basis in
a sequence .
a) Both the assertion and the reason are true statements and the reason is an adequate explanation for
the assertion.
b) Both the assertion and the reason are true statements and the reason does not explain the assertion.
c) Assertion is true statement but the reason is false statement.
d) Both the assertion and the reason are false statements.
Answer in a sentence or two:
6. Define an artificial variable.
7. Write the objective function in phase I of Two phase method with 3 artificial variables A1,A2 and A3
8. Define an unbalanced assignment problem.
9. What is meant by no passing rule in a sequencing problem?
10. Write condition to reduce n jobs k machines problem to n jobs 2 machines in sequencing.
SECTION B
ANSWER ALL THE QUESTIONS, SELECTING ONE FROM EACH SET:
11(a) Solve by using Two phase simplex method
Maximize Z = 5X1+3X2
Subject to
2X1+X2 1
X 1+4X2 6
X 1 , X2 0
(OR)
11(b) Write the steps in solving a L.P.P by two phase technique .
12(a) Solve the assignment problem so as to get the maximum sales .

3 X 5 =15

Tasks/Machines
A
B
C
D

E
42
30
30
24

F
35
25
25
20

G
28
20
20
16

H
21
15
15
12

(OR)
12(b) Solve the following traveling salesman problem to minimize the cost per cycle:
To
To
A
B
C
D
E
From
A

3
6
2
3
B
3

5
2
3
C
6
5

6
4
D
2
2
6

6
E
3
3
4
6

13 (a) Five jobs are to be processed on two machines A and B in the order A-B. Processing time in hours
are given in the following table.
Job
1
2
3
4
5
Machine A
5
1
9
3
10
Machine B
2
6
7
8
4
.
Find an optimal sequence that minimizes the total elapsed time and also find the idle time.
(OR)
13(b) A machine shop has 4 machines A,B,C,D. Two jobs must be processed through each of these
machines. The time (in hours ) taken on each of the machines and the necessary sequence of jobs
through the shop are given below.
Sequence

Time

Sequence

Time

Job 1

Job2
2 6

Use graphic method to find the minimum total elapsed time.

SECTION C

2 x 12 = 25

ANSWER ANY TWO QUESTIONS:

14(a)
(b)

Write the algorithm to solve a L.P.P. by Charnes method of penalty.

Solve by Big M method
Maximize Z=2X1+3X2
Subject to

X1+2X24
X1+X2 3
X1 , X20

(7

15(a) Explain Hungarian Method of solving an Assignment problem

b) Solve the assignment problem so as to get the minimum expenses.
Tasks
1
2
3
4
16 (a)

(5 Marks)

A
10
15
35
17

B
25
30
20
25

C
15
5
12
24

D
20
15
24
20

1
Marks )
2
(5 marks)
(7

1
Marks )
2

E
5
12
13
9

Explain the steps in solving n jobs k machines sequencing problem.

(5 marks)

(b)
the

Job
Machine M1

A
10

B
12

C
8

D
15

E
16

Machine M2

Machine M3

Machine M4

14

12

10

following sequencing problem .

(7

*********

Solve

1
Marks )
2