DEPARTMENT OF MATHEMATICS

Indian Institute of Technology, Guwahati

MA591 : Optimization Techniques MidSem

27-05-2020 Instructor : Sukanta Pati
Time : submit by 9 pm Total marks : 60

Answers will NOT be evaluated starting from the first MISTAKE. Each of the conclusions drawn in
between MUST be supplied with proper arguments. Do NOT use concepts that has not been covered
in the lectures or lecture notes. Use pencils for convenience.

1. Use KT theory to maximize x1 +x2 −x3 −x4 over the region S = {(x ∈ R4 | x21 +x22 +x23 +x24 ≤
25, x1 + x2 + x3 + x4 = 8}. 10

2. Consider the region given below. We want to minimize −2x − y over this region.

R4 (2, 3)
(0, 3) v
R3
(3, 2)
R2
(3, 1)
R1

(2, 0)

a) Write the problem table using the line Ri for row i. 1

b) Write the simplex table at the basic solution corresponding to v. 3

c) Apply dual simplex method to solve it. 6

3. A person wants to donate money to four persons A,B,C,D. He has four astrologer advisors.

Astrologer 1: Donate whatever but twice the mount of A subtracted from the amount of the
rest, should not exceed 100 (millions), otherwise something bad may happen to you.

Astrologer 2: Donate whatever but thrice the mount of B subtracted from the amount of the
rest, should not exceed 100 (millions), otherwise something bad may happen to you.

Astrologer 3: The mount of B and C taken together, subtracted from the amount of the rest
should not exceed 100 (millions), otherwise something bad may happen to you.
 Astrologer 4: Twice the mount of D subtracted from the amount of the rest should not exceed
100 (millions), otherwise something bad may happen to you.

The person has just finished donating as much as possible. Do you know the amount he
donated? 10

4. A company has 4 factories and four outlets. It has to supply goods to the outlets. The cost
of transportation per unit of goods, the availability and the capacity of the outlets is given
below. This year due to lock down, the total production is less than the total capacity of the
outlets. However, due to the unmatched demand, the outlet 1 must be filled completely. Find
the minimum cost for transporting all the goods to the outlets. 10

Outlet 1 Outlet 2 Outlet 3 Outlet 4 Production

Factory 1 2 3 1 4 200
Factory 2 1 2 3 1 200
Factory 3 3 1 2 3 400
Factory 4 2 2 3 2 200
Capacity 400 300 300 200

5. Find the minimum cost assignment from the given matrix. The computer reads from top-left,
goes to the right, then down. 10
 
2 3 1 1 5 3 3 1 2 2
 
4 2 2 7 1 5 1 4 1 4
 
 
2 3 4 6 2 1 3 5 4 1
 
 
4 1 2 4 2 5 6 7 4 2
 
 
3 4 1 2 3 4 5 6 3 2
 
A= 
4 1 5 3 6 3 2 4 4 5
 
 
1 6 4 2 7 6 4 3 5 6
 
 
4 1 3 5 2 3 4 2 5 3
 
 
 
3 3 1 4 3 3 4 6 5 4
 
2 1 2 2 4 3 3 5 6 3

6. My friend has fixed four points A, B, C ∈ R4 . Each component of each vector is at least 1. So
they are outside the sphere S : x2 + y 2 + z 2 + t2 − 1 = 0. Given any point P = (x, y, z, t) ∈ S,
the sum of the squares of the distances of P from the points is computed and called f (P ).
He asks to find a point P where f (P ) is the minimum. Display how will you use bordered
Hessian here. 10

(Three leading principal minors starting from detA means : take det A; delete the last row
and last column then take determinant; again delete the last row and last column then take
determinant.

It may be better to compute the minors before substituting different values of w, x, y, z, t.)