Compre Part B-4
Compre Part B-4
Hyderabad Campus
MATH F212: OPTIMIZATION
Comprehensive Examination
PART B
Date: December 27, 2022 Time: 75 min
Day: Tuesday Marks : 36
Note: 1. Answer all the questions. Marks for each question are given at the end of the question.
2. All your calculations and notations should be as per the prescribed Textbook.
_________________________________________________________________________
1. Consider the following transportation problem (having Three sources S1, S2, S3 and Four
destinations D1, D2, D3, D4). [19M]
D1 D2 D3 D4 Supply
S1 55 35 13 0 130
S2 44 25 25 10 160
S3 32 13 12 75 170
Deman 105 110 105 140
d
a. Using the least cost starting
solution compute the iterations leading to optimal solution (use the method of
multipliers and take u1 =0 always)
b. Does problem have alternative optimal solution (if so) find the alternative optimal
transportation schedule and cost.
2. Solve the following QPP by (stating necessary KKT conditions) using modified simplex
method
2
Maximize x 1+ x2 −x1 [17M]
Subject to
x 1+ 2 x 2 ≤2
x1 , x2 ≥ 0
Birla Institute of Technology & Science, Pilani
Hyderabad Campus
MATH F212: OPTIMIZATION
Comprehensive Examination
PART B
Date: December 27, 2022 Time: 75 min
Day: Tuesday Marks : 36
Note: 1. Answer all the questions. Marks for each question are given at the end of the question.
2. All your calculations and notations should be as per the prescribed Textbook.
_________________________________________________________________________
1. Consider the following transportation problem (having Four sources S1, S2, S3, S4 and
three destinations D1, D2, D3). [19M]
D1 D2 D3 Suppl
y
S1 55 44 32 105
S2 35 25 13 110
S3 13 25 12 105
S4 0 10 75 140
Demand 130 160 170
a. Using the least cost starting solution compute the iterations leading to optimal solution
(use the method of multipliers and take u1 =0 always)
b. Does problem have alternative optimal solution (if so) find the alternative optimal
transportation schedule and cost.
2. Solve the following QPP by (stating necessary KKT conditions) using modified simplex
method [17M]
2
Maximize x 1+ x2 −x2
Subject to
2 x1 + x 2 ≤2
x1 , x2 ≥ 0