Professional Documents
Culture Documents
SEWP ZC132
Course Title
Type of Exam
Open Book
Weightage
60 %
Duration
180 minutes
Date of Exam
Saturday, 20.09.2014
No. of Pages : 2
No. of Questions : 8
Session : FN
Note:
1. Please read and follow all the instructions given on the cover page of the answer script.
2. Start each answer from a fresh page. All parts of a question should be answered consecutively.
3. Please answer the questions in the order in which they appear in the question paper.
1. (a)
Let
R4 . find the
the basis
of the subspace.
marks)
(b) Solve the following system of equations using Gauss Siedel method correct up to two
x+ y+ 54 z=10,27 x +6 y z=85 ,
2.
6 x+ 15 y +2 z=72
dimension and
(2
iterations:
(4 marks)
Reduce the following to row echelon form and find the Rank of the matrix
1 1 0 0
0
0
2 3
A=
4 0
2 1
3 1
0 4
(6 marks)
3.
A small business makes 3-speed and 10-speed bicycles at two different factories. Factory A produces 16 3-speed
and 20 10-speed bicycles in one day. Factory B produces 12 3-speed and 20 10-speed bicycles daily.It costs
$1000.00 per day to operate factory A and $800.00 per day to operate factory B. An order for 96 3-speed bicycles
and 140 10-speed bicycles has just arrived. Using Graphical method find how many days should each factory be
operated in order to fill this order at a minimum cost. What is the minimum cost of operation?
(8 marks)
4. (a)
Let
If
| A+ I |=0 where I denotes the 3X3 identity matrix then find the eigen value of A.
be a 3 x 3 matrix with real entries such that det ( A )=6 and the trace of A is 0.
(b) Does there exist a 3x3 symmetric matrix with eigen values
and corresponding eigen vectors
[ ] [] []
0
1
1
1
0
0
0
1
1
= -1
, 2=3, 3 =7
(3 marks)
For the following LP find three alternative optimal basic solutions, and then write a general expression for all the
non-basic alternative optima comprising these three basic solutions.
Maximize
z=x 1+ 2 x 2 +3 x 3
subject to
x 1+2 x 2+ 3 x 3 10
x 1+ x 2 5
x1 1
x1 , x2 , x3 0
(8
marks)
6.
Solve the following LPP for primal and dual values by generalized simplex iterative method.
Minimize
z=x1 +5 x 2
subject to
2 x 13 x 2 1
x 1+ x 2 3
x1 , x2 0
7.
(8 marks)
Minimize
Z =x1 + x 2 + x3
Subject to
x 13 x2 + 4 x 3=5
x 12 x 2 3
2 x 2x 3 4 , and
(8 marks)
8.
each of two
x 1 , x 2 0 , x 3 is unrestricted.
P1 , P2 , P3 and
P1
WORKSHOP 1
WORKSHOP 2
3
6
P2
4
2
P3
8
5
P4
6
8
P1 , P2 , P3 and
available in each workshop. The LP model formulated for determining the optimal mix is as follows
Max z =4 x 1 +6 x 2+10 x 3 + 9 x 4
3 x1 + 4 x 2+ 8 x 3 + 6 x 4
x 1+2 x 2+ 5 x 3
400
400
x4
S 1 and S 2 respectively and using simplex method, we get the final table
as
Cj
B.V.
x2
S2
(a)
CB
XB
6
0
x2
x1
100
200
10
0.75
4.5
1
0
x3
2
1
0
S1
x4
1.5
5
0.25
-0.5
S2
0
1
mark)
(b)
(c)
In what range can the profit margin per unit of P2 vary without changing the optimal basis?
(d)
(1 mark)
(2 marks)
(e)
in Workshop 1 and ten hours in Workshop 2. What is the minimum profit margin needed on
this new product to make it worth producing?
(2 marks)
(2 marks)