Operation Research Techniques

Part-A Questions 1. Define unbounded solution 2. What do you mean by a general LPP? 3. Define feasible region. 4. Define constraint 5. State any three salient features of a LPP . Define infeasible solution !. Define slac" # sur$lus %ariable &. Define o$timal solution '.Write the standard form of LPP in (atri) form. 1*. What is degeneracy in LPP? 11. What is "ey column+ "ey ro,? -o, is it selected. 12. Stat the condition for an unbounded solution of a LPP? 13. Define .rtificial %ariable. 14. What is the use of artificial %ariable? 15. /i%e mathematical formulation of assignment $roblem. 1 . List any three a$$roaches used ,ith trans$ortation $roblem for determining the starting solution. 1!. What d you mean by trans$ortation $roblem? 1&. What is the use of (0D1 method? 1'. Define degenerate and non2degenerate basic feasible solution of a trans$ortation $roblem. 2*. What is unbalanced trans$ortation $roblem? -o, to sol%e it? 21. Define an assignment $roblem. 22. -o, ,ill you re%ise the o$$ortunity cost matri) of a n assignment $roblem+ if it does not gi%e the o$timal solution? 23. What do you mean by a $ro3ect? 24. What do you mean by an acti%ity of a $ro3ect? 25. Define net,or". 2 . Define 4S5 # L65. 2!. 1n in%entory models+ What is mean by 7 and 83. 2&. . Particular item has demand of '+*** units9year. 5he cost of one $rocurement is :s.1** and the holding cost $er unit is :s.2.4* $er years. 5he re$lacement is instantaneous and no shortages are allo,ed. Determine the economic lot si;e. 2'. Define <alue of the game? 3*. When 5,o2$erson ;ero sum game has a saddle $oint? 31. Differentiate P4:5 and 8P( 32. Define $ure strategy. 33. Define grou$ re$lacement. 34. What is tra%elling salesman $roblem? 35. Define assignment $roblem. 3 . What is an unbalanced trans$ortation $roblem?

Part-B Questions 1.Sol%e the follo,ing LPP $roblem by sim$le) method (a)imi;e 15 x1 + x 2 + ' x3 + 2 x 4 Sub3ect to
2 x1 + x 2 + 5 x3 + x 4 2* 3x1 + x 2 + 3 x3 + 25 x 4 24 ! x1 + x 4 !* x1 + x 2 + x3 + x 4 *

2. Sol%e the follo,ing L.P.P by the gra$hical method.

Maximize z = 3x1 + 2 x 2 x1 2 x1 + x 2 3+ and x1 + x 2 * Subject to 2 x1 + x 2 1

3. Sol%e the follo,ing LPP by =ig2( method

(inimi;e > = 3) + 2y sub3ect to !) + 2y 3* 5) + 4y 2* 2) +&y 1 )+ y *

4. Determine basic feasible solution to the follo,ing trans$ortation $roblem using North West Corner Rule SinK Suppl A B C D E y P 2 11 10 3 7 4 Origi Q 1 4 7 2 1 8 n R 3 9 4 8 12 9 Demand 3 3 4 5 5. 6ind the starting solution of the follo,ing trans$oration model by Least Cost method 1 0 3 10 2 4 1 10 6 2 5 10 7 12 11

. 6ind an o$timal solution by MO ! method of the follo,ing matri) using "AM for finding the initial solution 1 21 1! 2! 1* 2 1 1& 1& 12 3 25 14 41 15 4 13 23 41 15 Su$$ly 11 13 1'

1 11 111 Demand

!. . machine o$erator has to $erform t,o o$erations+turning and threading on a number of different 3obs. 5he time re7uired to $erform these o$erations ?in minutes@ for each 3ob is "no,n. Determine the order in ,hich the 3obs should be $rocessed in order to minimi;e the total time re7uired to turn out all the 3obs. Time %or turnin& Time %or threadin& #o$ 'minutes( 'minutes( 1 3 & 2 12 1* 3 5 ' 4 2 5 ' 3 11 1 !. Dra, the net,or" and determine the critical $ath for gi%en data #o$s uration )-* )-+ 5 *-, +-, +-- ,-1* 3 4 ,-. 2 --. '

&. 8onstruct the net,or" for the $ro3ect ,hose acti%ities are gi%en belo, and com$ute the total+ free and inde$endent float of each a%ti%ity and hence determine the critical $ath and $ro3ect duration.

Acti/it0
uration 'in 3ee4s(

1-) 3

)-* &

)-+ 12

*-,

*-3

+-, 3

+-. &

,-2 5

--2 3

.-2 &

'. . $articular item has a demand of '+*** units9year. 5he cost of one $rocurement is :s.1** and the holding cost $er unit is :s.2.4* $er year. 5he re$lacement is isntantaneous and no shortages are allo,ed. Determine i@ the economic lot si;e. ii@ the number of orders $er year iii@ the bet,een orders i%@ the total cost $er year if the cost of one units is :e.1 1*. .n item is $roduced at the rate of 5* items $er day. 5he demand occurs at the rate of 25 items $r day. 1f the setu$ cost is :s.1** $er setu$ and holding cost is :e.*.*1 $er unit of item $er day+ find the economic lot si;e for one run+ minimum total cost for one run.

11. Asing the $rinci$le of Dominance sol%e the follo,ing game

& 1* ' 14 1* 11 & 12 13 12 14 13

12. Sol%e the follo,ing game by gra$hical method

! 4 5 1 2 2 5 !

13. :educe the game by dominance and find the game %alue

! !! !!! !"

1 3 3 4 *

11 2 4 2 4

111 4 2 4 *

1< * 4 * &

14. Sol%e the trans$ortation $roblem using <.( and find the o$timal solution ,hose

cost+ demand+ su$$ly are gi%en by the follo,ing table W1 P1 P2 P3 Demand 2* 4& 35 1** W2 2& 3 55 !* W3 32 4* 22 5* W4 55 44 45 4* W5 !* 25 4& 4* Su$$ly 5* 1** 15*

15. .n item is $roduced at the rate of 5* units $er day. 5he demand is at the rate of 25

units $er day. 5he set u$ cost is 1** $er unit $er day. 6ind the 40B and the minimum annual in%entory cost. .fter ho, many days should $roduction be sto$$ed during each run?

1 . . manufacturer has a su$$ly 12*** units of a $roduct $er year to his customer. Shortages are not $ermitted and there is no lead time. 5he in%entory holding cost is :s.*.2* $er unit $er month and the set u$ cost $er run is :s.35*. Determine the economic lot si;e+ the $eriod of one run+ the minimum annual in%entory cost.

1!. 1n a game of matching coins ,ith t,o $layers+ su$$ose . ,ins one unit %alue ,hen

there are t,o heads+ ,ins nothing there are t,o tails+ and losses C units %alue ,hen there are one head and one tail. Determine the $ayoff matri)+ the best strategy for each $alyer+and the %alue of the game.

1&. Ase sim$le) method to (in >D)223)3E2)5

3 x 2 x3 + 2 x5 ! 2 x 2 + 4 x3 12 4 x 2 + 3 x3 + & x5 1*

Sub3ect to and x 2 + x3 + x5 * 1'. Sol%e the follo,ing game by gra$hical method

4 1 2 !
3 2*. Sol%e the follo,ing game 2 2 1 3 2 1 2

! 5 2 5

2 3 1 1

21. 6ind the se7uence for the follo,ing eight 3obs+ that ,ill minimi;e the total ela$sed time for the com$letion of all the 3obs. 4ach 3ob is $rocessed in the same order F8+ .+ =G. 4ntries gi%e the time in hours on machines #o$s Times on Machine A Times on Machine B Times on Machine C ) 4 & 5 * 1* + ! ! 2 , 4 & 3 5 11 4 . 3 & ' 2 ' 15 5 2 13 11

22. . $ro3ect consists of the tas"s .+ =+ 8+D+4 +6+/+ -+ 1 ,ith the follo,ing data

Acti/it0 Preceedin& acti/it0 uration

A 22 23

B 22 &

C 22 2* . 1

6 . 24

7 =+D 1&

8 8 1'

9 = 4

! 6+/ 1*

8onstruct net,or". 6ind critical $ath. .lso find 5otal+ 1nde$endent and 6ree floats

23. Sol%e the follo,ing tra%eling salesman $roblem. . salesman is $lanning to tour cities

=+8+ D+4 starting from his home city .. 5he inter2city distances are sho,n in the follo,ing table

8ity . = 8 D 4

. 22 1*3 1&& 13 3&

= 1*3 22 2 2 1! 52

8 1&& 2 2 22 &5 2!5

D 13 1! &5 22 1 2

4 3& 52 2!5 1 2 22