HOLY CROSS COLLEGE (Autonomous) , TIRUCHIRAPPALLI -620 002.

DEPARTMENT OF MATHEMATICS
III B.Sc MATHEMATICS( SHIFT I & II) , SEMESTER V , NOVEMBER 2015
MAJOR CORE 10: OPTIMIZATION TECHNIQUES I

MODEL QUESTION PAPER

Time : 3 Hours

Code: U08MA5MCT12
Max. Marks : 100
SECTION A
ANSWER ALL THE QUESTIONS.

20 x 1 = 20

Choose the correct answer.

1. The number of variables required to solve a L.P.P. by Graphical method is
a) 2
b) 1
c) 3
d) 4
2. The variable that is required to convert 3x + 2y 5 to an equation is
a) surplus variable b) slack variable
c) basic variable
d) non basic variable
3. The condition for selecting a variable into basis in simplex method is
a) min(zi-cj) < 0
b) max(zi-cj) > 0 c) maxd(zi-cj) < 0 d) min(zi-cj)> 0
4. For maximization LPP, the objective function coeffieient for an artificial variable is
a) M

b) -M

c) +1

d) zero

5. A basic solution to a transportation problem with m resources and n destinations is basic if the
number of allocations are
a) m + n -1
b) m + n+ 1
c) m + n
d) m - n
6. 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

7. The minimum number of lines covering all zeros in a reduced cost matrix of order n is
a) atmost n
b) atleast n
c)n-1 d) n+1
8. Time required by a job on each machine is
a)processing order b) processing time c) idle time

d) total elapsed time

9. Match the following properties of an assignment problem with a suitable terms and choose the
correct answers
1) Number of assignments in a n job and n machines is
A) 4!
2) 4 jobs & 4 works
B)(n-1)!
3) General assignment
C) equal to n
4) routing problem with n cities
D) one to one basis
E) n!
a)1A,2B,3C,4E

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

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

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

10. Of the following pair of statements, one is an assertion and the other is the possible reason. Read
the statements carefully and mark your answer according to the key given.
Assertion : When there is no common region in the I quadrant in the solution to a L.P.P. by
graphical method, the problem is said to have an infeasible solution.
Reason : Feasibility in a L.P.P. refers to positive nature of the decision variables.
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 explains the
assertion.

c) Assertion is true statement but the reason is false statement.

d) Both the assertion and reason are false statements.
Answer the following in a sentence or two.
11. What are the components of a linear programming model?
12. Write down the standard form of a L.P.P.
13. Define a Basic feasible solution of a L.P.P.
14. How do you conclude that a L.P.P has an unbounded solution while using simplex method?
15. Define degenerate basic feasible solution in a transportation problem.
16. When is a transportation problem said to be balanced?
17. State the condition for optimality in a transportation problem by MODI method.
18. Define an unbalanced assignment problem.
19. State no passing rule in a sequencing problem.
20. Define total elapsed time.
SECTION B

5 x 7 = 35

ANSWER ALL THE QUESTIONS, SELECTING ONE FROM EACH SET:

11(a)
11(b)

Write the steps in mathematical formulation of a L.P.P. in detail.

(OR)
Solve graphically:
Minimize z = - x1 + 2 x2
Subject to - x1 + 3 x2 12
x 1 + x2 7
x1 x2 2,

x1, x2 0

12a) Solve by Big M Method :

Maximize Z=3X 1+4X2
-3X1+2X2 1
5X 1-4X2 5
Non negative X1,X20

Subject to,

(OR)
12b) Solve by using Two phase simplex method
Maximize Z=5X1+3X2
Subject to,
2X1+X21
X 1+4X26
Non negative X1,X20
13(a)

Obtain an initial basic feasible solution to the following transportation problem by North West
corner rule explaining the steps.
Warehouse
A
B
C
Requirements

I
5
4
6
7

Market
II
III
2
4
8
1
6
7
12
17
(OR )

IV
3
6
5
9

Supply
22
15
4

13(b)

Using Matrix minima method find an initial basic feasible solution the following
transportation problem explaining the steps.

From
Demand

9
7
6
6
4

12
3
5
8
4

To
6
7
11
2
2

9
7
9
11
6

9
5
3
2
4

Supply
5
6
2
9

10
5
11
10
2

14a) Solve the assignment problem so as to get the maximum sales(given the sales)
Tasks
/Machines
A
B
C
D

42
30
30
24

35
25
25
20

28
20
20
16

21
15
15
12

(OR)
14b) Solve the following traveling salesman problem so as to minimize the cost per cycle:
To
To
2
10

9
10
8

1
8
14
10

From
1
2
3
4
5

3
25
10

24
25

4
25
15
20

27

5
10
2
10
15

15a) In the machine, 8 different products being manufactured each requiring time on two machines are
given below. Determine a sequence for the 8 jobs that will minimize the elapsed time. Also find the
idle time for machine.
Product
Machine I
Machine II

1
30
20

2
45
30

3
15
50

4
20
35

5
80
36

6
120
40

7
65
50

8
10
20

(OR)
15b) A machine shop has 4 machines A,B,C,D. Two jobs must be processed through each of these
machines. The necessary sequence of jobs through the shop are given below.Use graphical method
to obtain the total minimum elapsed time
sequence

time

sequence

time

Job1
1

Job2

SECTION C

3 x 15= 45

ANSWER ANY THREE QUESTIONS:

16.
A company has three operational departments (weaving , processing and packing ) with
capacity to produce two different types of clothes namely suiting and shirting yielding a profit
of Rs. 20 and Rs. 40 per meter respectively.One meter of suiting requires 3 minutes in weaving,
2 minutes in processing and 1 minute in packing. Similarly one meter of shirting requires 4
minutes in weaving, 1 minute in processing and 3 minutes in packing. In a week total run time
of each department is 60 and 40 hours of weaving,processing and packing
respectively.Formulate a L.P. model and solve the above problem.
17 a) Write the Simplex algorithm to solve a L.P.P.
b) Solve by simplex method
Maximize z = 4x1 + 10 x2
Subject to
2x1 + x2 50
2x1 + 5x2 100
2x1 + 3x2 90,
x1, x2 0

(6)

(9)

18 a) Write the steps in MODI method of solving a transportation problem.

(6)
b) Solve the following transportation problem by MODI method (Use Vogels Approximation
method for initial solution.
Destination
(Profit/unit in Rupees)
D1
D2
D3
D4
D5
Supply
Factory

F1
F2
F3

Demand

35
14
45

41
21
18

28
28
17

16
30
29

20
15
26

125

125

100

175

175

320
180
200
(9)

19 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
5

A
20
4
23
17
16

B
22
26
14
15
19

C
35
24
17
16
21

D
22
24
19
18
19

(6 )
(9)

E
18
7
19
15
25

20 a) Write the algorithm to solve a 3 machine k job sequencing problem.

(6 )

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, name and discuss the scheduling model used.
Job
Machine
M1
Machine
M2

A
3

B
8

C
7

D
4

E
9

F
8

G
7

(9)

Machine
M3

*******

11

12