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

DEPARTMENT OF MATHEMATICS
III B.Sc MATHEMATICS( SHIFT I & II) , SEMESTER V , I INTERNAL TEST : AUGUST 2014
MAJOR CORE 10: OPTIMIZATION TECHNIQUES I
Time : 2 Hours

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

10 x 1 = 10

Choose the Correct answer:

1.

The number of variables required to solve a L.P.P. by graphical method is

a) 2
2.

b) 1

c) 3

d) 4

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.

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
4.

Match the following conditions in solving a transportation problem, with a suitable type of
solution and choose the correct answer.
1.All zij-cij<=0

A. Alternate optimal Basic feasible solution

2.Atleast one zij-cij>0

B. Non degenerate optimal Basic feasible solution

3. All zij-cij<0,atleast one zij-cij=0

C. Optimal Basic feasible solution.

4. All zij-cij<=0,m+n-1 basic variables

D. Degenerate optimal basic feasible solution

E. Basic feasible solution

a).1C,2E,3A,4B

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

c). 1A,2E,3D,4B

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

5.

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 in a sentence or two the following:
6.
What are the components of linear programming model.
7.
Write down the standard form of a L.P.P.
8.
State the relation between the values of the two types of objective functions of a L.P.P.
9.
Define degenerate basic feasible solution in a transportation problem.
10.
When is a transportation problem said to be unbalanced?
.
SECTION B
3 x 5 = 15
ANSWER ALL THE QUESTIONS, SELECTING ONE FROM EACH SET:
11(a)

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

OR

11(b)

Solve graphically:

Minimize z = - x1 + 2 x2
Subject to - x1 + 3 x2 0
x 1 + x2 0
x1 x2 2,

x1, x2 0

12(a)

12(b)
13(a)

Define
a. Canonical form of a L.P.P.
c.net evaluation in simplex method.

b.Basic feasible solution.

d. convex set.
e.extreme point.

OR
Write down the steps in graphical method explaining the different types of solution to a
L.P.P.
Obtain an initial basic feasible solution to the following transportation problem by North
West corner rule explaining the steps.
Market
Warehouse

II

III

IV

Supply

22

15

12

17

Requirements

13(b)

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

From

12

10

11

11

11

10

SECTION C

2 x 12 = 25

ANSWER ANY TWO QUESTIONS:

14.

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.

15a). Write the Simplex algorithm to solve a L.P.P.

(5)
b) Solve by simplex method
Maximize z = 4x1 + 10 x2
Subject to
2x1 + x2 50
2x1 + 5x2 100
2x1 + 3x2 90,
x1, x2 0
(7.5)
16.a) Write the steps in MODI method of solving a transportation problem.
(5.5)
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

Demand

F1
F2
F3

35
14
45

41
21
18

28
28
17

16
30
29

20
15
26

125

125

100

175

175

320
180
200
(7)

*****