Você está na página 1de 2

() f-P U UlPi:

~ - r O L U L ~ 1
Roll No.
Thapar University, P atiala
School of Mathematics a nd Comput er Applications
End-Semester Examination, Optimization Techniques (UMA-031)
M ay 24, 2011
Course Coordinator : Dr . Meenakshi Rana
Note: Attempt all the questions in the given sequence
on the top of t h e answer sheet.
only. Do writ e
T ime : 03 Hour s
Max. Marks: 50
your tutorial group
Ql (a) Let 51 and 52 be two disjoint nonempty convex sets in H", Then show t hat t he set
5 = {XI - X2 : X l E 51, X
2
E 52} is convex. [2]
(b) Solve : Minimize z = 7:1 - 2 X2
subject to Xl + X2 ~ 2, - Xl +7:2 ~ 1, X2 :S 1, .7:1, X2 ~ O. [4]
(c) (i) Give t he mathemat ical formulat ion of an assignment problem.
(ii) A compa ny has 4 engineers to assign 4 projects. Five proj ects are offered to t he company wi th the
following expected pro fits :
r, P
2
P
3
P
4
P
s
El 62 78 50 101 82
E2 71 84 61 73 59
Es 87 92 I II 71 81
E
4
48 64 87 77 80
Project H is very important an d it. must be taken. by the company. Find the op timal assignment of
engineers to the pro jects so as to maximize the total profit . Also ident ify t he project which th e company
should decline. [2 ...:...4]
Q2 The opt imal table of an LPP is :
Zj - Cj 0 0 12/5 1/ 5 4/ 5 0 Solution
CB B Xl X2 X3 $ 1 52 $3 11
-1
X l 1 0 4/5 2/5 1/ 10 0 4
3 X2 0 1 2/5 1/ 5 3/10 0 5
0 $3 0 0 11 1 -1/2 1 11
;'t.t
(i) Find the cost coefficients of t he original problem. In what range Cl can be varied so that t he current
opt imal solution rema ins un changed.
(ii) Fi nd t he R.H.S. vector b = (b
l,
b
2,b3).
Within what range bl can be varied so t hat t he cur rent opt imal
solution remains unchanged.
(iii) Discuss the effect on the optimal basic feasible solution by adding a new const rai nt Xl + X2 ~ 10 to
t he given set of constraints.
(iv) Find the dual of t he original LPP and hence find an opt imal solut ion of the dual.
[3+ 2+2+6]
Q3 (a ) Consider a t ranspor t ation problem whose cost matrix is given below :
51
52
53
b
j
D
I
D
2 D3
D
4
2 10 4 5
6 8 8 2
4 2 5 7
25 10 15 5
1
a i
10
25
20
16
1
where a,:i = 1,2 ,3 and b,J: j = 1, 2, 3, 4 is t he availability and demand at source S, and destinat ion Dj re
spectively. Let a feasi ble solut ion of thi s pr oblem is X1 3 = 10, X2 1 = 20: X 24 = 5: X31 = 5, X 32 = 10, X3 3 = 5.
Assuming that it is a cost minimi zing t ransportation problem, answer the following questi on givi ng brief
reason for t he same ;
(i) Find a nonbasic opt imal solut ion.
(ii) Writ e t he dual of t his transport ation pr oblem. [4+ 2)
(b) Solve t he 'following int eger programming probl em :
Maximize z = 7 Xl + 9 X 2
subj ect t o - X l + 3 X2 S 6, 7Xl + X2 S 35, Xl S 7, Xl , X2 0 and int egers.
/3]
(c) A network with 5 nodes is as follows :
Arc : 1-2 2-1 1-4 2-3 3-2 4-3 4-5 5-4 5-3 3-5 4-2
Distance : 5 10 10 10 5 20 10 10 5 10 10
(i) Find the shor t est distance from source node 1 to anot her nodes.
(ii) If the worker decides not to pass through node 4, then find t he short est distance from node 1 t o
node 5.
[3+ 1)
Q4 (a) Consider t he problem : Minimize f(X I , X2) = 2 X I X2 + X2 - :[;1- X
o
= (O, O) T.
Perform three it erat ions of steepest descent met hod. [3]
(b) Use Kuhn-Tucker condit ions t o find t he value of 0' for which (Xl = 1, X2 = 2) is opt imal for t he
pr oblem : Maximize z = 2:;; 1 + aX2 subject to xt + S 5, ;;; 1 - X2 S 2. (3]
(c ) The following informati on is available for a proj ect ;
Act ivity : A BC D E F G
Predecessor(s ) - - B B B E A, D , C
Norm al ti me (weeks) ; 10 8 5 6 8 5 8
Normal cost (Rs '000) ; 20 15 8 11 9 5 3
Crash t ime (weeks) ; 7 6 4 4 5 4 8
Crash cost (Rs '000) : 30 20 14 15 15 8 4
Dr aw the proj ect. network. Also, determine the normal cost proj ect duration and t hen find the associat ed
minimum proj ect cost for 18 weeks. [6]
'J
..-thoW\;
LDrlL he.
DYv

().Y')A LD o:

the.,
D-IIS
eu F-A-
No .
1(\
Room
30/ ,-0 rJ
1"1 CLd

.o
foUnd
COE
-10 - \I Qr",
I L -t- I Nf"

MecharJca1
12- I pnv