Professional Documents
Culture Documents
Major Core 10.optimization Techniques
Major Core 10.optimization Techniques
DEPARTMENT OF MATHEMATICS
III B.Sc. MATHEMATICS( SHIFT I & II) , SEMESTER V , I INTERNAL TEST :
AUGUST 2015
MAJOR CORE 10: OPTIMIZATION TECHNIQUES I
Time : 2 Hours
Code: U08MA5MCT12
Max. Marks : 50
SECTION A
ANSWER ALL THE QUESTIONS:
Choose the Correct answer:
1.
10 x 1 = 10
In the set of all feasible solutions to a L.P.P. by graphical method ,an optimal
solution using the feasible region is at
2.
a) all points
b) at any point
d) an interior point
a) type
3.
b) type
c) inequalities
d) equations
a) min z j - c j 0
c) max z j - c j < 0
4.
d) min z j - c j > 0
b) max z j - c j > 0
B. (1 ,1 )
D. any (i , j )
E. min ( 1 , j ) for j= 1,2,
a) 1C,2E,3A,4B
b) 1B,2E,3A,4C
c) 1A,2E,3D,4B
d) 1B,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 : A variable which is unrestricted in sign should be expressed as the difference
between two positive variables in the mathematical form of a L.P.P.
Reason : Feasibility conditions are optional in the decision variables involved in a
L.P.P..
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 :
6.
Define a convex set.
7.
When is a solution to a L.P.P.by graphical method said to be unbounded?
8.
9.
10.
SECTION B
3 x 5 = 15
Solve graphically:
Minimize z = x1 + 0.5 x2
Subject to 3x1 +2 x2 12
5 x1
10
x1 + x2 3
x1, x2 0
(OR)
11(b) Solve graphically:
Maximize z = 3 x1 + 2 x2
Subject to - 2x1 + x2 1
x1
2
x1 + x2 3,
12(a) Define
a. Standard form of a L.P.P.
b. extreme point.
x1, x2 0
b.Basic solution.
d. slack and surplus variables.
(OR)
12(b) Solve by Simplex method : Max z = 21x1+15x2
Subject to x1+2x2 6
4x1+3x2 12 ,
x1 , x2 0
13(a) Obtain an initial basic feasible solution to the following transportation problem by
Row minima method explaining the steps.
Warehouse
Shop
II
III
IV
100
125
150
60
80
85
105
70
Demand
Supply
(OR )
13(b) Using Matrix minima method find an initial basic feasible solution to the following
transportation problem explaining the steps.
To
From
Availability
34
15
12
19
Requirement 21
25
17
17
17
SECTION C
2 x 12 = 25
A firm manufactures two products A and B on which the profits earned per unit are
Rs. 3 and Rs. 4 respectively.Each product is processed on two machines M1 and
M2.Product A requires one minute of processing time on M1 and two minutes on M2
while B requires one minute on M1 and one minute on M2 .Machine M1 is available
for not more than 7 hours and 30 minutes, while machine M2 is available for 10
hours during any working day. Find the number of units of products A and B to be
manufactured to get maximum profit.
(6)
x1, x2 , x3 , x4 0
(6.5)
(5.5)
Factory
Demand
F1
F2
F3
35
14
45
41
21
18
28
28
17
16
30
29
20
15
26
12
24
19
125
125
100
175
175
75
*****
320
180
200
(7)