Birla Institute of Technology & Science, Pilani

Online B.Sc. Computer Science Programme

Second Semester 2022-2023
Comprehensive Exam 2
SLOT-2

Course No. : BCS ZC230

Course Title : Linear Algebra and Optimization
Nature of Exam : Open Book
Weightage : 50%, 50 marks No. of Pages = 3
Duration : 2 Hours 30 Minutes No. of Questions = 5
Date of Exam : 11-06-2023

Note to Students:
1. All parts of a question should be answered consecutively.
2. Each question should start from a fresh page.
3. Answer all the questions.

Q1 Let there be three numbers x , y and z . A triangle ABC has sides AB, BC and CA of length 3 y units,
2 x units and z units respectively. The sum of length of side BC and CA exceeds the length of side
AB by 6 units. If each side of the triangle is increased by 1 unit, then the new perimeter becomes 21
units. It is also given that, twice the length of side CA is equal to the sum of other two sides.

a) Formulate the above problem as a system of linear equations in terms of x , y and z . Represent
this system in matrix notation AX=B. Also, write the augmented matrix. (3 marks)

b) Using Cramer's Rule, find the solution for the system of linear equations in part (a). (6 marks)

Q2 a) Let Pi be vector space of polynomials of degree less than or equal toi . Find the basis for the Null
d f (x)
Space of the linear transformation T from P2 → P3 where T ( f ( x ) )= + xf (x ). Also verify the
dx
Rank-Nullity theorem (Rank Theorem). (3 marks)

b) Consider the matrix

Starting with x0=[1,1]T find dominant eigenvalue and the corresponding eigenvector of the above
matrix using Power Method. Perform 3 iterations only (Keep 3 places after decimal with rounding).
(3 marks)

c) Using Cayley Hamilton Theorem find the inverse of the matrix A , where A is given by:

Do not find the inverse directly. (5 marks)

Q3 a) The figure given below represents the traffic flow in the net of one-way streets (in the directions
indicated by the arrows) shown. If at each junction A , B ,C , and D the total number of vehicles
entered is equal to the number of vehicles left. Formulate a system of linear equations based on the
given information. Then solve the system using Gauss Elimination method to determine x 1 , x 2 , x 3 and
x4 .
(5 marks)

b) If a company produces 3 types of multivitamin candies. One unit of candy-1 contains 10 mg of

vitamin B, 1 mg of vitamin C and 1 mg of vitamin D. One unit of candy-2 and candy-3 contain1 mg
of vitamin B. Candy-2 contains 10 mg of vitamin C and 1 mg of vitamin D. Candy-3 contains 1 mg
of vitamin C and 10 mg of vitamin D. If only 12mg of each type of vitamin is available, formulate a
system of equations to find the number of candies of each type that can be made by using all the
resources available. Solve the system using Gauss- Seidel Method (2 iterations and 4 digits after
decimal) with initial value as 0.0 , 0.0 and 0.0 . (5 marks)

Q4 a) Consider the following LPP

Maximize z=3 x 1+ x2 +2 x 3
Subject to
x 1+ 2 x 2 +s 1=5
x 1+ 2 x 2−x 3 + s2=2
4 x 1+ 3 x 2−5 x 3 +s 3=10
x 1 , x 2 , x 3 , s1 , s 2 , s3 ≥ 0

T
i) Find the solution corresponding to the basic variables [ x1 , x3 , s 3 ] . (2 Marks)
ii) Using matrix manipulation directly construct the simplex table for the basic variables
T
[ x1 , x3 , s 3 ] . (3 marks)
iii) What can be said about the solution of the given LPP from the table that you have obtained
above? (1 mark)
(Note: Use matrix form of simplex method. No marks will be awarded for directly
writing the answer therefore, show all the calculations clearly. Note that there is no
need to perform simplex iterations. )
 b) The following table is corresponding to some iteration of the simplex method for a maximization
problem:

Basic RHS

Perform further iterations to find the optimal table for this problem. (4 marks)

Q.5 a) Consider the following LPP.

Minimize z=25 x1 −75 x 2−50 x 3

subject ¿
3 x 1−x 2+2 x 3 ≤ 7
2 x1 −4 x 2 ≥12
−4 x 1+3 x 2 +8 x3 =10
¿ x 1 , x 2 ≥ 0 ; x 3 unrestricted ∈sign
(i) Write the dual problem. (2 Mark)
(ii) If the optimal basic variables are x 1 , x 2∧x 3 determine the associated optimal dual
solution. It is given that (2 Marks)

[ ]
8 −7 −2
25 50 25

[ ]
−1
3 −1 2
4 −8 −1
2 −4 0 =
25 25 25
−4 3 8
1 1 1
10 20 10
c) Given below is the initial tableau corresponding to phase-1 of the two-phase method for a
minimization LPP, where s1 , R ❑1 , R2 are the surplus and artificial variables corresponding to
some constraints. Find the optimum solution of phase 1. (6
Marks)

Basic r x1 x2 x3 s1 R1 R2 RHS
r 1 0 0 0 0 -1 -1 0

R1 0 1 -2 1 -1 1 0 15

R2 0 2 4 1 0 0 1 50

***********