OPERATION RESEARCH

CE605A
1) An n dimensional convex polyhedron having exactly (n+1) vertices is called

a) Simplex b) Convex Hull c) Sphere d) Triangle.

2) Give a system of m simultaneous linear equations in n unknown variables (m<n) the no. of
basic variables will be
a) m b)n c) n-m d) m-n.

3) What is the method used to solve an LPP involving artificial variables?

a) Simplex Method b) Charnes Big M Method C) VAM d)None of these.

4) The shortest path between any two nodes in a network determined by

a) Dijkastra’s Algorithm b) Floyd’s Algorithm c) CPM d) None of these.

5) In an assignment problem, the minimum number of lines covering all the zeroes in the
reduced cost matrix of order n can be
a) at most n b) n+1 c) n-1 d) at least n

6) If the maxmin and minmax value of the game be equal then

a) There is a saddle point b) solution does not exists
c) Strategies are mixed d) none of these

7) In a fair game the value of the game is

a) 0 b) 1 c) unbounded d) none of these.

8) An assignment problem can be solved by

a) Hungarian Method b) VAM c) Matrix Minima method d) None of these

9) In queuing theory,traffic intensity is

a) Mean arrival rate/mean service rate b) mean service rate/mean arrival rate
c) Queue length/service rate d) none of these

10) The set S = {all point on a circle whose centre is origin and radius is 1} is
a) a convex set b)a concave set c)not a convex set d)both concave and convex

11) In PERT analysis which of the following distribution assumed for the duration of the activity
a) Normal b) Beta c) Poisson d) Exponential

12) From the following methods ___________ is a method to obtain initial solution to
Transportation Problem.
a. North-West b. Simplex c. Hungarian d. Newton Raphson

13) A necessary and sufficient condition for a basic solution to a maximization type problem to
be an optimal is that(for all j)
a)Zj-Cj≥0 b)Zj-Cj≤0 c) Zj-Cj=0 d) Zj-Cj>0 or Zj-Cj<0.

14) A transportation problem is a balanced transportation problem if

a) total demand and total supply are equal and number of sources equal to the number of
 destinations
b) total demand equals to the total supply irrespective of the number of sources and
destinations
c) number of sources matches with the number of destinations
d) the corresponding basic feasible solution is to be degenerate.

15) In a scheduling network,

a) critical path means a longest path from start to end and there can be more than such path
b) critical path is the longest path from start to end and there are only one such path
c) critical path means a shortest path from start to end and there is more than one such path
d) critical path means a shortest path from start to end and there can be only one such path.

16) The Objective of network analysis to

a. Minimize total project duration
b. Minimize total project cost
c. Minimize production delays, interruption and conflicts
d. All of the above

17) To find the critical path, in the forward path calculation, we calculate for every tail node of
each activity the
a) Latest start time b) Latest finish time c) Earliest start time d) Earliest finish time.

18) A game is called a fair game if

a) Value of the game is zero
b) Value of the game is greater than zero
c) Value of the game is less than zero
d) None of the above

19) The solution of a transportation problem with m rows and n columns is non - degenerate if
number of allocation are
a) m+n b) mn c) m+n-1 d) m+n+1.

20) The slack for an activity is equal to

a. LF-LS b. EF-ES c. LS-ES d. None of the above

21) A necessary and sufficient condition for a basic solution to a minimization type problem to
be an optimal is that(for all j)
a) Zj-Cj≥0 b)Zj-Cj≤0 c) Zj-Cj=0 d) Zj-Cj>0 or Zj-Cj<0.

22) Linear programming model which involves funds allocation of limited investment is
classified as
a) Ordination budgeting model b) capital budgeting models
c) Funds investment models d) funds origin models

23) In transportation models designed in linear programming, points of demand is classified as

a) Ordination b) transportation c) destinations d) origins

24) In linear programming, lack of points for a solution set is said to

a) have no feasible solution b) have a feasible solution
c) have single point method d) have infinite point method

25) In maximization problem, optimal solution occurring at corner point yields the
a) mean values of z b) highest value of z c) lowest value of z d) mid values of z
26) In linear programming, oil companies used to implement resources available is classified as
a) Implementation modelling b) transportation models c) oil model d) resources
modelling

27). In minimization problem, better solution can be formed if positive quantities are assigned
to
a) Positive basic variables b) negative basic variables
c) Negative non-basic variables d) positive non-basic variables

28) In less than or equal to constraint equations, variable which is used to balance both side of
equations is classified as
a) Solving variable b) condition variable c) slack variable d) positive variable

29) Column in simplex initial table used to represent new basic variable is classified as
a) column variable b) key column c)key row d) row variable

30) In simplex method, slack, surplus and artificial variables are restricted to be
a) multiplied b) negative c) non-negative d)divided

31) In simplex method basic solution set as (n-m), all variables other than basic are classified as
a) constant variable b) non positive variables c) basic variables d) non-basic variable

32) In simplex method, feasible basic solution must satisfy the

a)non-negativity constraint b)negativity constraint c)basic constraint d)common constraint

33) Third requirement of simplex method is that all variables are restricted to include
a) negative even values b) odd values c)even values d)non-negative values

34) According to algebra of simplex method, slack variables are assigned zero coefficients
because
a) no contribution in objective function b)high contribution in objective function
c) divisor contribution in objective function d) base contribution in objective function

35) Right hand side constant in ith constraint in primal must be equal to objective coefficient for
a) jth primal variable b) ith dual variable c) ith primal variable d) jth dual variable

36) In linear programming, related problems in linear programming are classified as

a) dual variables b)single problems c)double problems d)dual problems

37) Dual problem statement is formulated with help of information available in another
statement
called
a) primal problem b) prime problem c) optimal problem d) primal constants

38) Variable in dual problem which can assume negative values, positive values or zero values
is classified as
a)unrestricted constant b)restricted constant c) restricted variable d)unrestricted variable

39) In primal-dual solutions, dual problem solution can be obtained by solving other problems
classified as
a) unrestricted problem b) original problem c) double problem d) restricted problem
40) If in a LPP, the solution of a variable can be made infinity large without violating the
constraints, the solution is
a) Infeasible b) Unbounded c) Alternative d) None of the these

41) In maximization cases, _______________are assigned to the artificial variables as their

coefficients in the objective function
a) +m b)–m c) 0 d) none of the above

42) In simplex method, we add _______________ variables in the case of ‘=’

a) Slack Variable b) Surplus Variable c) Artificial Variable d) None of the these

43) A BFS of a LPP is said to be _____________ if at least one of the basic variable is zero
a) Degenerate b) Non‐degenerate c) Infeasible d) Unbounded

44) In LPP, degeneracy occurs in ____________ stages

a) One b) Two c) Three d)Four

45) Every LPP is associated with another LPP is called ___________________

a)Primal b)Dual c)Non‐linear programming d)None of the above

46) Operations research is the application of ____________methods to arrive at the optimal

solutions to the problems.
a. economical b. scientific c. a and b both d. artistic

47. Feasible solution satisfies __________

a. Only constraints b. only non-negative restriction c. [a] and [b] both
d. [a] , [b] and Optimum solution

48. In Degenerate solution value of objective function _____________.

a. increases infinitely b. decreases infinitely c. basic variables are nonzero
d. One or more basic variables are zero

49. Minimize Z = ______________

a. – maximize(Z) b. maximize(-Z) c. -maximize(-Z) d. none of the above

50. In graphical representation the bounded region is known as _________ region.

a. Solution b. feasible solution c. basic solution d. optimal

51. In graphical method the restriction on number of constraint is __________.

a. 2 b. 3 c. not more than 3 d. none of the above

52. Graphical optimal value for Z can be obtained from

a. Corner points of feasible region b. corner points of the solution region
c. Both a and b d. none of the above

53. In LPP the condition to be satisfied is

a. Constraints have to be linear b. Objective function have to be linear
c. both [a ]and [b] d. none of the above

54. The linear function of variables which is to be maximized or minimized is called

a. constraints b. basic requirements c. objective function d. none of them

55. An alternative optimal solution to a minimization transportation problem exists whenever

 opportunity cost corresponding to unused routes of transportation is:
a. positive and greater than zero
b. positive with at least one equal to zero
c. negative with at least one equal to zero d. all of the above
56. The _________ variable is added to the constraint of less than equal to type.
a. slack b. surplus c. artificial d. basic

57. For the constraint of greater than equal to type we make use of ______________variable.
a. slack b. surplus c. artificial d. basic

58. A constraint in an LP model restricts

a. value of the objective function b. value of the decision variable
c. use of the available resources d. all of the above

59. If the value of the objective function z can be increased or decreased indefinitely, such
solution is called _____________
a. Bounded solution b. Unbounded solution c. Solution d. None of the these

60. The coefficient of slack variable in the objective function is _________________.

a. -M b. +M c. 0 d. none of them

ANSWERS MCQ
1)b 2)c 3)b 4)a 5)a 6)a 7)a 8)a 9)a 10)a 11)a 12)a
13)a 14)b 15)b 16)a 17)c 18)a 19)c 20)c 21)b 22) b 23) c 24) b
25) b 26) b 27) d 28) c 29) b 30) c 31) d 32) a 33) d 34) a 35) b 36) d

37) a 38) d 39) b 40) b 41) a 42) c 43) a 44) b 45) b 46)b 47)c 48)d

49)c 50)b 51)d 52)a 53)c 54)c 55)b 56)a 57)b 58)b 59)b 60)c

61. A company has two grades of inspectors, I and II, who are to be assigned for a quality
control inspection. It is required that at least 2000 pieces be inspected per 8 hour day. Grade I
inspectors can check pieces at the rate of 50 per hour with an accuracy of 97%. Grade ll
inspectors can check pieces at the rate of 40 per hour with an accuracy of 95%. The wage rate
of Grade 1 inspectors is Rs. 4.50 per hour and that of Grade II is Rs. 2.50 per hour. Each time
an error is made by an inspector, the cost to the company is one rupee. The company has
available, for the inspection job, 10 grade I and 5 Grade ll inspectors. Formulate the problem
to minimize the total cost of inspection.

62. A furniture manufacturer wishes to determine the number of tables and chairs to be made
by him in order to optimize the use of his available resources. These products utilize two
different types of timber and he has on hand 1500 board feet of the first type and
1000 board feet of the second type. He has 800 man-hours available for the total job. Each
table and chair requires 5 and 1 board feet respectively, of the first type of timber and 2 and
board feet respectively of the second type. 3 man-hours are required to make a table and 2
man-hours are needed to make a chair. The manufacturer makes a profit of Rs. 12.00 on a
table and Rs. 5.00 on a chair. Write out the completelinear programming formulation of the
problem in terms of maximizing the profit.

63. A factory is engaged in manufacturing two products A and B which involve lathe work,
grinding and assembling. The cutting, grinding and assembling times required for one unit of
A are 2, 1 and 1 hours respectively and for one unit of B are 3, 1 and 3 hours respectively.
The profits on each unit of A and B are Rs. 2.00 and Rs. 3.00 respectively. Assuming that
300 hours of lathe time, 300 hours of grinding time and 240 hours of assembling time, are
available, pose a linear programming problem in terms of maximizing the profit on the items
manufactured.

64. A firm, manufacturing two types of medicine A and B, can make a profit of Rs. 20 per
bottle of A and Rs. 30 per bottle of B. Both A and B need for their production two essential
chemicals C and D. Each bottle of A requires 3 litres of C and 2 litres of D and each bottle
of B requires 2 litres of C and 4 litres of D. The total supply of these chemicals are 210 litres
of C and 300 litres of D. The total supply of these chemicals are 210 litres of C and 300 litres
of D. Type B medicine contains alcohol and its manufacture is restricted to 65 bottles per
month. How many bottles each of A and B should the firm manufacture per month to
maximize its profit of the products How much is this profit ? (Use graphical method).

65. Old hens can be bought for Rs. 2.00 each but young one costs Rs. 5.00 each. The old hens
lay 3 eggs per week and young ones 5 eggs per week, each egg being worth 30 paise, A hen
costs Re. 1.00 per week to feed. If I have only Rs. 80.00 to spend for purchasing the hens,
then how many of each Kind should I buy to have a maximum profit per week assuming that
I cannot house more than 20 hens? (Pose the problem and solve graphically).

66. A toy company manufactures two types of doll, a basic version-doll A and a deluxe
version-doll B. Each doll of type B takes twice as long to produce as one of type A and the
company would have time to make a maximum 2000 pér day if it produces only the
basic version. The supply of plastic is sufficient to produce 1500 dols per day (both A and B
combined). The deluxe version requires a fancy dress of which there are only 600 per day
available. If the company makes a profit of Rs. 3 and Rs. 5 per doll respectively on doll A
and B, then how many of each should be produced per day in order to maximize the profit ?

67. Upon completing the construction of his house Mr. Sharma discovers that 100 sq. ft. of
plywood scrap and 80 sq. ft. of white pine SC rap are in usable form for the construction of
tables and book-cases. It takes 16 sq. ft. of plywood and 8 sq. ft. of white pine to make a
table; 12 sq. ft. of plywood and 16 sq. ft. of white pine are required to construct a book-case.
By selling the finished products to a local furniture store Mr. Sharma can realise a profit of
Rs. 25.00 on each table and Rs. 20.00 on each book-case. How may he most profitably
use the left over wood ? Use graphical method to solve the problem.

68. A fim can produce three types of cloth, say A, B and C. Three kinds of wool are required
for it, say, red wool, green wool and blue wool. One unit length of type A cloth needs 2 yards
of red wool and 3 yards of blue wool; one unit length of type B cloth needs 3 yards of red
wool, 2 yards of green wool and 2 yards of blue wool and one unit of type C cloth needs 5
yards of green wool and 4 yards of blue wool. The firm has only a stock of 8 yards of red
wool, 10 yards of green wool and 15 yards of blue wool. t is assumed that the income
obtained from the one unit length of type A cloth is Rs. 3.00, of type B cloth is Rs. 5.00 and
of type C cloth is Rs. 4.00. Formulate a problem how should the firm use the available
material so as to maximize the income from the finished cloth, assuming that all units
produced are wool and onesold

69. A manufacturer of patent medicines is preparing a production plan on medicines A and B.

There are sufficient ingredients available to make 20000 bottles of A and 40000 bottles of B,
but there are only 45000 bottles into which either of the medicines can be put. Furthermore it
takes three hours to prepare enough material to fill 1000 bottles of A, it takes one hour to
prepare enough material to fill 1000 bottles of B and there are 66 hours available for this
operation. The profit is Rs. 8.00 per bottle of A and Rs. 7.00 per bottle of B. Formulate this as
a linear programming problem to maximize the profit.

70. A chemical firm stores its output of glucose at depots in Delhi and Madras. The depot at
Delhi has 100 quintals of glucose in store whereas. that at Madras has 150 quintals. Two
customers A and B have their works at Patna and Nagpur respectively and at a particular
time require 120 quintals and 110 quintals respectively. The cost to the supplier of delivering
one quintal is given in the following table:
From Delhi From Madras
To Patna Rs. 50 Rs. 20
To Nagpur Rs. 60 Rs. 30
The Delhi depot has arranged already for a sub-contractor to deliver 30 quintals out of 110
quintals required at Nagpur and this quantity cannot be reduced. Find how distribution should
be organised to have the minimum delivery cost.

Solve by Graphical method the following LPP

71. MINZ=3 x + y
Subject ¿2 x +3 y ≤ 6
x+ y≥1
x , y ≥ 0.

72. MINZ=3 x + y
Subject ¿2 x +3 y ≤ 6
x+ y≥1
x , y ≥ 0.
73. Min z =5 x −2 y
Subject ¿ ,2 x +3 y ≥ 1
x , y ≥0

74. Max z=150 x+100 y

subject ¿ , 8 x +5 y ≤60 ,
4 x+5 y ≤ 40 ,
x , y ≥0

75. Max z=x+ 3 y

subject ¿ ,3 x +6 y ≤ 8 ,
5 x+ 2 y ≤ 10 ,
x , y ≥0
76. Max z=5 x+7 y
subject ¿ ,10 x +7 y ≤35 ,
x+ y≤ 4
3 x+ 8 y ≤ 24 ,
x , y ≥0

77. Max z=2 x+ y

subject ¿ , x + y ≥ 5
2 x+3 y ≤ 20 ,
4 x+3 y ≤ 25 ,
x , y ≥0

78. Min z =2 x− y
subject ¿ , x + y ≤ 5
x +2 y ≤ 8 ,
4 x+3 y ≥ 12,
x , y ≥0

79. Min z =−x+ 2 y

subject ¿ ,−x +3 y ≤10 ,
x+ y≤6,
x− y ≤ 2
x , y ≥0

80. Min z =3 x + y
subject ¿ , 2 x +3 y ≤ 6 ,
x + y ≥ 10 ,
x , y ≥0

81. Max z=4 x+2 y

 subject ¿ ,3 x + y ≥ 27 ,
−x− y ≤−21 ,
x +2 y ≥ 30
x , y ≥0

82. Max z=5 x+7 y

subject ¿ ,3 x +8 y ≤12 ,
x+ y≤2,
2 x≤3
x , y ≥0

83. Min z =3 x + y
subject ¿ , 2 x +3 y ≥ 8 ,
x+ y≥1,
x , y ≥0

84. Max z=2 x+ y

subject ¿ , 2 x + y ≤3 ,
3 x+ y ≤ 1 ,
x , y ≥0

85. Max z=6 x +10 y

subject ¿ ,3 x +5 y ≤10 ,
5 x+ 3 y ≤ 15 ,
x , y ≥0

86. Max z=6 x +2.5 y

subject ¿ ,7 x +9 y ≤ 63 ,
12 x+5 y ≤ 60 ,
x , y ≥0

87. Max z=3 x+ 2 y

subject ¿ , x − y ≤ 8 ,
x+ y≥3,
x , y ≥0

88. Max z=3 x+ 4 y

subject ¿ ,−3 x +2 y ≤ 6 ,
−x +3 y ≤ 18 ,
x , y ≥0

89. Max z=3 x+5 y

subject ¿ ,5 x +5 y ≤25 ,
13 x+ 13 y ≤ 117 ,
 x , y ≥0

90. Max z=x+ 2 y

subject ¿ , 2 x + y ≤2 ,
3 x+ 4 y ≥ 12,
x , y ≥0
91. Max z=9 x+ 8 y
s ubject ¿ , 4 x +3 y ≤ 30 ,
2 x+3 y ≤ 18 ,
x , y ≥0

92. Max z=3 x− y

subject ¿ , 2 x + y ≥2 ,
x +3 y ≤ 2 ,
y ≤4
x , y ≥0

93. Min z =20 x+10 y

subject ¿ , x +2 y ≤ 40 ,
3 x+ y ≥ 30 ,
4 x+3 y ≥ 60
x , y ≥0

94. Min z =3 x +5 y
subject ¿ , 2 x +3 y ≥ 12 ,
−x + y ≤3 ,
x≤ 4
x , y ≥0

95. Max z=4 x+2 y

subject ¿ ,3 x + y ≥ 27 ,
−x− y ≤−21 ,
x +2 y ≥ 30
x , y ≥0
96. Max z=x+ y
subject ¿ ,5 x +9 y ≤ 45 ,
x+ y≥2,
y ≤4
x , y ≥0

97. Max z=3 x+ 4 y

subject ¿ , x − y ≥ 0 ,
−x +3 y ≤ 3 ,
x , y ≥0
98. Max z=2 x− y
subject ¿ , x − y ≤ 1 ,
x≤3
x , y ≥0

99. Max z=2 x−3 y

subject ¿ , x + y ≤ 2 ,
2 x+ 2 y ≥ 8
x , y ≥0

100. Max z=10 x+15 y

subject ¿ , x + y ≥ 2 ,
3 x +2 y ≤ 6
x , y ≥0

Solve by SIMPLEX method the following LPP

101. Min Z=4x1+3x2

Subject to
x1+2x2 ≥ 8
3x1+2x2 ≥ 12
And x1, x2 ≥ 0

102. Min Z = 12x1+20x2

Subject to 6x1+8x2 ≥ 100
7x1+12x2 ≥120
x1, x2 ≥0.

103. Max z=5 x1 +3 x 2

subject ¿ ,3 x 1 +5 x2 ≤ 15 ,
5 x 1+2 x 2 ≤ 10
x1 , x2 ≥ 0

104. Max z=2 x1 +3 x 2

subject ¿ , x 1 + x 2 ≤ 1 ,
3 x 1+ x 2 ≤ 4 ,
x1 , x2 ≥ 0

105. Min z =4 x 1 +14 x 2

subject ¿ , 2 x 1 +7 x 2 ≤ 21 ,
7 x 1+ 2 x 2 ≤ 21
x1 , x2 ≥ 0
106. Min z =x1 −3 x 2 +2 x 3
subject ¿ ,3 x 1−x 2 +2 x 3 ≤7 ,
−2 x 1+ 4 x 2 ≤ 12
−4 x 1+3 x 2 +8 x3 ≤ 10 ,
x1 , x2 , x3 ≥ 0

107. Max z=3 x 1+2 x 2+ 5 x 3

subject ¿ , x 1 +2 x 2+ x 3 ≤ 430 ,
3 x 1+2 x 3 ≤ 460 ,
x 1+ 4 x 2 ≤ 420 ,
x1 , x2 , x3 ≥ 0

108. Max z=3 x 1+ x 2 +3 x 3

subject ¿ , 2 x 1 + x 2+2 x 3 ≤ 2 ,
x 1+ 2 x 2 +3 x3 ≤ 5
2 x1 +2 x 2+ x3 ≤ 6 ,
x1 , x2 , x3 ≥ 0

109. Max z=3 x 1+2 x 2

subject ¿ ,3 x 1 +4 x 2 ≥12 ,
2 x1 + x 2 ≤2 ,
x1 , x2 ≥ 0
110. Max z=x 1+ 4 x 2 +3 x3
subject ¿ , x 1 +2 x 2−3 x 3 ≥ 22,
2 x1 −x2 +5 x 3=40 ,
3 x 1+ x 2 +2 x3 =30 ,
x1 , x2 , x3 ≥ 0

111. Min z =3 x 1−2 x 2

subject ¿ , x 1−x 2 ≤1 ,
3 x 1−2 x 2 ≤6
x1 , x2 ≥ 0

112. Max z=5 x1 +2 x 2+ 2 x 3

subject ¿ ,3 x 1−2 x 2−2 x3 =−8
3 x 1−4 x 2−x 3=−7 ,
x1 , x2 , x3 ≥ 0
113. Max z=−x 1−x 2−x 3
subject ¿ , x 1−x 2 +2 x3 =2
−x 1+ 2 x 2−x 3=1 ,
 x1 , x2 , x3 ≥ 0
114. Max z=6 x 1+ 4 x 2
subject ¿ ,3 x 1 +4 x 2 ≤ 6 ,
x 1+ 3 x 2 ≥3
x1 , x2 ≥ 0
115. Max z=x 1+5 x 2
subject ¿ , 2 x 1 +3 x2 ≤30 ,
3 x 1+2 x 2 ≤ 24 ,
x 1+ x2 ≥ 3
x1 , x2 ≥ 0

116. Min z =4 x 1 +3 x 2
subject ¿ , x 1 +2 x 2 ≥ 8 ,
3 x 1+2 x 2 ≥ 12
x1 , x2 ≥ 0
117. Max z=3 x 1−x2
subject ¿ , x 1 +3 x 2 ≤ 3 ,
2 x1 + x 2 ≥2
x1 , x2 ≥ 0
118. Max z=2 x1−3 x 2
subject ¿ ,5 x 1 +4 x 2 ≤ 46 ,
7 x 1+ 2 x 2 ≥ 32
−x 1+ x2 ≥−2
x1 , x2 ≥ 0
119. Max z=5 x1 −2 x 2 +3 x 3
subject ¿ , 2 x 1 +2 x 2−x 3 ≥2 ,
3 x 1−4 x 2 ≤3 ,
x 2+ 3 x 3 ≤5 ,
x1 , x2 , x3 ≥ 0
120. Max z=2 x1 + x 2 +3 x3
subject ¿ , x 1 + x 2+ 2 x 3 ≤5 ,
2 x1 +3 x 2 +4 x 3=12
x1 , x2 , x3 ≥ 0

Find the dual the following LPP

121. Find the dual of the following LPP
MaxZ=2x1+3x2+4x3
Subject to x1-5x2+3x3 = 7
2x1-3x2+4x3 ≤ 3
x1, x2 ≥ 0 and x3 is unrestricted in sign
122.kln Find the dual of the following LPP
 MaxZ=2x1+7x2+5x3
Subject to
2x1+5x2+7x3 ≤ 17
3x1+2x2+5x3 = 13
5x1+3x2+x3 ≤ 9
x1, x3≥0
and x2 is unrestricted in sign.
123. Max z=2 x1 +5 x 2+ 6 x3
subject ¿ ,5 x 1 +6 x 2−x 3 ≤ 22 ,
−2 x 1+ x 2 +4 x3 ≤ 4 ,
x 1−5 x 2+3 x 3 ≤1
−3 x 1−3 x2 +7 x 3 ≤6 ,
x1 , x2 , x3 ≥ 0

124. Max z=x 1+ 4 x 2 +3 x3

subject ¿ , x 1 +2 x 2−3 x 3 ≥ 22,
2 x1 −x2 +5 x 3=40 ,
3 x 1+ x 2 +2 x3 =30 ,
x1 , x2 , x3 ≥ 0

125. Min z =3 x 1−2 x 2

subject ¿ , 2 x 1 + x 2 ≤ 1,
−x 1+ 3 x 2 ≥ 4 ,
x1 , x2 ≥ 0

126. Max z=2 x1 +3 x 2+ 4 x 3

subject ¿ , x 1−5 x 2 +3 x3 =7 ,
2 x1 −5 x 2 ≤3 ,
3 x 2−x 3 ≥ 5 ,
x 1 , x 2 ≥ 0 , , x 3 is unrestricted in sign.

127. Max z=6 x 1+5 x 2 +10 x3

subject ¿ , 4 x 1 +5 x 2 +7 x 3 ≤ 5 ,
3 x 1+7 x 3 ≤10 ,
2 x1 + x 2 +8 x 3=20 ,
2 x 2+ 9 x 3 ≥5 ,
x 1 , x 3 ≥ 0 , x 2 is unrestricted in sign.
128. Max z=3 x 1+ x 2 +2 x3 −x 4
subject ¿ , 2 x 1−x 2 +3 x 3 + x 4 =1 ,
x 1+ x2 −x3 + x 4 =3 ,
x 1 , x 2 ≥ 0 , x 3 , x 4 is unrestricted in sign.

129. Min z =x1 −3 x 2 +2 x 3

subject ¿ ,3 x 1−x 2 +2 x 3 ≤7 ,
−2 x 1+ 4 x 2 ≤ 12,
−4 x 1+3 x 2 +8 x3 ≤ 10 ,
x1 , x2 , x3 ≥ 0

130. Max z=x 1+ 4 x 2 +3 x3

subject ¿ , 2 x 1 +3 x2−5 x 3 ≤2 ,
3 x 1−x 2+6 x 3 ≥1 ,
x 1+ x2 + x 3=4 ,
x 1 , x 2 ≥ 0 , x 3 is unrestricted in sign.

Solve the following TRANSPORTATION problem finding the minimum cost

131.
D E F G Available

A 11 13 17 14 250

B 16 18 14 10 300

C 21 24 13 10 400

Demand 200 225 275 250

132.
A B C ai
F1 10 9 8 8
F2 10 7 10 7
F3 11 9 7 9
F4 12 14 10 4
10 10 8

133.
 D1 D2 D3 D4 SUPPLY
O1 10 7 3 6 3
O2 1 6 8 3 5
O3 7 4 5 3 7
DEMAND 3 2 4 6
134.
D1 D2 D3 D4 D5 ai
O1 3 4 6 8 8 20
O2 2 10 0 5 8 30
O3 7 11 20 40 3 15
O4 1 0 9 14 16 13
bj 40 6 8 18 6

135.
W1 W2 W3 W4 ai
F1 3 8 7 4 30
F2 5 2 9 5 50
F3 4 3 6 2 80
bj 20 60 55 40

136.
D1 D2 D3 D4 D5 D6 ai
O1 1 2 1 4 5 2 30
O2 3 3 2 1 4 3 50
O3 4 2 5 9 6 2 75
O4 3 1 7 3 4 6 20
bj 20 40 30 10 50 25

137.
D1 D2 D3 D4 ai
O1 23 27 1 18 30
O2 12 17 20 51 40
O3 22 28 12 32 53
bj 22 35 25 41

138.
D1 D2 D3 D4 ai
O1 5 3 6 4 30
O2 3 4 7 8 15
O3 9 6 5 8 15
bj 10 25 18 7
139.
D1 D2 D3 D4 D5 ai
O1 73 40 9 79 20 8
O2 62 93 96 8 13 7
O3 96 65 80 50 55 9
O4 57 58 29 12 87 3
O5 56 23 87 18 12 5
bj 6 8 10 4 4

140.
W1 W2 W3 W4 ai
F1 6 4 1 5 14
F2 8 9 2 7 18
F3 4 3 6 2 7
bj 6 10 15 8

141.
D1 D2 D3 D4 D5 D6 ai
O1 5 3 7 3 8 5 3
O2 5 6 12 5 7 11 4
O3 2 1 3 4 8 2 2
O4 9 6 10 5 10 9 8
bj 3 3 6 2 1 2

142.
D1 D2 D3 D4 ai
O1 3 8 7 4 30
O2 5 2 9 5 50
O3 4 3 6 2 80
bj 20 60 55 40

143.
D1 D2 D3 D4 D5 ai
O1 4 1 3 4 4 60
O2 2 3 2 2 3 35
O3 3 5 2 4 4 40
bj 22 45 20 18 30

144.
D1 D2 D3 ai
 O1 2 7 4 5
O2 3 3 1 8
O3 5 4 7 7
O4 1 6 2 14
bj 7 9 18

145.
D1 D2 D3 D4 ai
O1 2 3 11 7 6
O2 1 0 6 1 1
O3 5 8 15 9 10
bj 7 5 3 2

146.
D1 D2 D3 D4 D5 D6 ai
O1 9 12 9 6 9 10 5
O2 7 3 7 7 5 5 6
O3 6 5 9 11 3 11 2
O4 6 8 11 2 2 10 9
bj 4 4 6 2 4 2

147.
D1 D2 D3 D4 ai
O1 19 20 50 10 7
O2 70 30 40 60 9
O3 40 8 70 20 18
bj 5 8 7 14

Solve the following ASSIGNMENT problem .

148.
D1 D2 D3 D4
J1 8 26 17 11
J2 13 28 4 26
J3 28 19 18 15
J4 19 26 24 10

149.
1 2 3 4
A 5 3 1 8
B 7 9 2 6
C 6 4 5 7
D 5 7 7 6
150.
M1 M2 M3 M4 M5
J1 160 130 175 19 200
0
J2 135 120 130 16 175
0
J3 140 110 155 17 185
0
J4 50 50 80 80 110
J5 55 35 70 80 105

151.
M1 M2 M3 M4 M5
R1 5 3 4 7 1
R2 2 3 7 6 5
R3 4 1 5 2 4
R4 6 8 1 2 3
R5 4 2 5 7 1

152.
M1 M2 M3 M4
J 10 24 30 15
1
J 16 22 28 12
2
J 12 20 32 10
3
J 9 26 34 16
4

153.
M1 M2 M3 M4 M5
J1 62 78 50 10 82
1
J2 71 84 61 73 59
J3 87 92 111 71 81
J4 48 64 87 77 80
154.
M1 M2 M3 M4 M5
R1 2.5 5 1 5 1
R2 2 5 1.5 7 3
R3 3 6.5 2 8 3
R4 3.5 7 2 9 4.5
R5 4 7 3 9 6
R6 6 9 5 10 6

155.
M1 M2 M3 M4
J 5 3 1 8
1
J 7 9 2 6
2
J 6 4 5 7
3
J 5 7 7 6
4

156.
M1 M2 M3 M4
J 1 4 6 3
1
J 9 7 10 9
2
J 4 5 11 7
3
J 8 7 8 5
4

157.
M1 M2 M3 M4 M5
J1 2.5 5 1 5 1
J2 2 5 1.5 7 3
J3 3 6.5 2 8 3
J4 3.5 7 2 9 4.5
J5 4 7 3 9 6
J6 6 9 5 10 6
158.
M1 M2 M3 M4
J 10 12 19 11
1
J 5 10 7 8
2
J 12 14 13 11
3
J 8 15 11 9
4

159.
M1 M2 M3 M4 M5
J1 32 38 40 28 40
J2 40 24 28 21 36
J3 41 27 33 30 37
J4 22 38 41 36 36
J5 29 33 40 35 39

160.
I II III IV V
A 6 5 8 11 16
B 1 13 16 1 10
C 16 11 8 8 8
D 9 14 12 10 16
E 10 13 11 8 16

161.
I II III IV V
A 11 17 8 16 20
B 9 7 12 6 15
C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15

162.
 M1 M2 M3 M4 M5
J1 45 40 65 25 55
J2 50 30 25 60 30
J3 25 20 10 20 40
J4 35 25 30 25 20
J5 80 60 50 70 50

Solve the following GAME problem (Use dominance property to solve the following game)

163.
10 5 5 20 4

11 15 10 17 25

7 12 8 9 8

5 13 9 10 5

164. For what value of x, the game is strictly determinable?

B1 B2 B3
A1 x 6 2
A2 -1 x -7
A3 -2 4 x

165. Use dominance property to solve the following pay-off matrix

B1 B2 B3 B4
A1 2 1 4 0
A2 3 4 2 4
A3 4 2 4 0
A4 0 4 0 8

166. Use dominance property to solve the following game

B1 B2 B3
A1 3 -2 4
A2 -1 4 2
A3 2 2 6

167.
B1 B2 B3 B4
A1 8 15 -4 -2
A2 19 15 17 16
A3 0 20 15 5
168.
B1 B2 B3
A1 2 -3 4
A2 -3 4 -5
A3 4 -5 6

169.
B1 B2 B3 B4
A1 3 2 3 0
A2 2 4 2 4
A3 4 3 4 0
A4 0 4 0 8

170.
B1 B2 B3 B4 B5
A1 4 2 1 7 -1
A2 1 -4 -6 -7 6
A3 3 2 3 4 2
A4 -6 1 -1 0 4
A5 0 0 6 0 0

171.
B1 B2 B3
A1 1 -1 -1
A2 -1 -1 3
A3 -1 2 -1

172.
B1 B2 B3
A1 -5 -1 -1
A2 4 0 2
A3 -5 2 0

173.
B1 B2 B3 B4 B5
A1 9 2 1 8 0
A2 6 5 4 6 7
 A3 2 4 4 3 8
A4 5 6 2 2 1

174.
B1 B2 B3
A1 -1 2 1
A2 1 -2 2
A3 3 4 -3

175.
B1 B2 B3 B4 B5
A1 -2 0 8 -5 0
A2 0 8 -5 0 14
A3 8 -5 0 14 -8
A4 -5 0 14 -8 0
A5 0 14 -8 0 20

176.
B1 B2 B3 B4
A1 -5 3 1 20
A2 5 5 4 6
A3 -4 -2 0 -5

177.
B1 B2 B3
A1 3 -1 -3
A2 -3 3 -1
A3 -4 -3 3

178.
B1 B2 B3 B4
A1 4 2 3 5
A2 -2 -1 4 -3
A3 5 2 3 3
A4 4 0 0 1

179.
 B1 B2 B3
A1 1 -1 3
A2 3 5 -3
A3 6 2 -2

180. For what value of x, the game is strictly determinable?

B1 B2 B3
A1 x 7 3
A2 -2 x -8
A3 -3 4 x

INVENTORY CONTROL

181. The production department for a company requires 3600 kg of raw material for manufacturing
particular item per year. It has been estimated that the cost of placing an order is Rs 36/- and the cost
of carrying inventory is 25% of the investment in the inventories. The price is Rs 10/- per kg. The
purchase manager wishes to determine an ordering policy for the raw material.

182. An aircraft company uses rebates at an approximate customer rate of 2500 kg/yr. Each
unit costs is Rs, 30 per kg. The company personal estimate that it cost Rs, 130 to place an
order and that the carrying cost of inventory is 10% per yr, how frequently should orders for
rebate be placed? Also determine optimum size of each order.

183. A contractor has to supply 10,000 bearings per day to an automobile manufacturer. He
finds that when he starts production run he can produce 25000 bearings per day. The holding
cost of a bearing in stock is Rs. 0.02 per year. Set-up cost of a production is Rs. 18. How
frequently should production run be made?

184. The annual demand of an item is 3200 units. The unit cost is Ks. 6/-and inventory
carrving charges 25% per annum. The cost of one procurement is Rs. 150. Determine.
(i) EOQ; (ii) No. of orders per vear: (iii) time between two consecutive order; (iv) the optimal
cost.

185. A company purchases 9000 parts of a machine for its annual requirements, ordering one
month's usage at a time. Each part cost Rs. 20. The ordering cost per order is Rs. 15 and the
carrying charges are 15% of the average inventory per year. You have been asked to
suggest a more economical purchasing policy for the company. What advice would you offer
and how much would it save the company per year?
186. A company has a demand of 12,000 units per year for an item and it can produce 20O00
such items per month. The cost of one set-up is Rs. 400 and the holding cost per unit per
month is Rs. 0.015. Find the optimum lot size, max inventory manufacturing time and the
total time.

187. The demand rate of a particular item is 12.000 units per year. The set-up cost per run is
Rs. 350 and the holding cost is Rs. 0.20 per unit per month. If no shortages are allowed and
the replacement is instantaneous, determine (i) The optimum run size. (i) The optimum
scheduling period (i1i) Minimum total expected annual cost.

188. The annual requirement for a product is 3000 units. The ordering cost is Rs. 100 per
order. The cost per unit is Rs. 10. The carrying cost per unit per year is 30% of the unit cost.
(a) Find the EOQ (b) by using better organisational methods the ordering cost per order is
brought down to Rs. 80 per order, but the same quantity as determined above were ordered.
(c) If a new E0Q is found by using the ordered cost as Rs. 80, what would be further savings
in cost?

189. A company has to supply 1000 times per month a uniform rate and each time a
production run is started it costs Rs. 200 Cost of storing is Rs. 20 per item per month. The
number of items to be produced per run has to be ascertained. Determine the total set-up cost
and average inventory cost if the run size is 500, 600, 700, 800. Find the optimal production
run size using EOQ formula.

190. The demand rate for an item in a company is 18000 units per year. The company can
produce at the rate of 3000 per month The set-up cost is Rs. 500 per order'and the holding
cost is 0.15 per units per month. Calculate
i) Optimum manufacturing quantity
ii) The maximum inventory
(iii) Time between orders
(iv) The number of orders per year
(v) The time of manufacture
(vi) The optimum annual cost if the cost of an item is Rs. 2 per unit.

191. A company purchases 8000 parts of a machine for its annual requirements, ordering one
month's usage at a time. Each part cost Rs. 15. The ordering cost per order is Rs. 10 and the
carrying charges are 25% of the average inventory per year. You have been asked to
suggest a more economical purchasing policy for the company. What advice would you offer
and how much would it save the company per year?
192. The demand rate of a particular item is 16.000 units per year. The set-up cost per run is
Rs. 300 and the holding cost is Rs. 0.20 per unit per month. If no shortages are allowed and
the replacement is instantaneous, determine (i) The optimum run size. (ii) The optimum
scheduling period (iii) Minimum total expected annual cost.

193. The production department for a company requires 2400 kg of raw material for manufacturing
particular item per year. It has been estimated that the cost of placing an order is Rs 24/- and the cost
of carrying inventory is 25% of the investment in the inventories. The price is Rs 10/- per kg. The
purchase manager wishes to determine an ordering policy for the raw material.

Example 148

QUIEING THEORY

194. Customer arrives at sales counter managed by a single according to a poisons process with a
mean rate of 20 per hour time required to serve customer has an exponential distribution a mean 100
seconds. Find the average waiting time of a customer.

195. In a Railway Marshalling yard goods trains arrive at 30 train per day assuming that inter arrival
time follows an exponential distribution and the service time follows poison distribution with an
average 36 minutes. Calculate the following:
(a) The mean queue size and,
(b) The probability that the queue size exceeds 10.
If the input of trains increases to an average 33 per day what will be the change in (a) and (b)

196.

197. A TV repairman finds that the time spend on his jobs as an exponential distribution with
mean 30minutes. If he repairs sets in the order in which they come in and if the arrival of sets
is approximately Poisson with an average rate of 10 per 8 hours day. What is repairman
expected idle time each day. How many jobs are ahead of the average set just brought in.

198. At what average rate must a clerk at a supermarket work in order to insure a probability
of 0.90 that the customers will not have to wait longer than 12 minutes? It is assumed that
there is only one Counter to which customers arrive in a Poisson fashion at an average rate
of 15 per hour. The length of service by the clerk has an exponential distribution.

199. Arrivals at a telephone booth are considered to be Poisson with an average time of 10
minutes between one arrival and the next. The length of a phone call is assumed to be
distributed exponentially with mean 3 minutes. What is the probability that a person arriving
at the booth will have to wait? What is the average length of the queue that forms from time
to time? The telephone department will install a second booth when convinced that an arrival
would except to have to wait at least three minutes for the phone. By how much must the
flow of arrivals be increased in order to justify second booth?

200. In a supermarket, the average arrival rate of customer is 10 every 30 minutes following
Poisson process. The average time taken by a cashier to list and calculate the customer's
purchase is 2.5 minutes following exponential distribution. What is the probability that the
queue length exceeds 6 ? What is the expected time spent by a customer in the system?

201. In a public telephone booth the arrivals are on the average 15 per hour. A call on the
average takes 3 minutes. If there is just one phone, find (i) the expected number of callers in
the booth at any time (ii) the proportion of the time the booth is expected to be idle?

202. In a railway marshalling yard, goods train arrive at the rate of 30 trains per day. Assume
that the inter arrival time follows an exponential distribution and the service time is also to be
assumed as exponential with mean of 36 minutes .Calculate
i) the probability that the yard is empty
(ii) the average queue length assuming that the line capacity of the
yard is 9 trains.

203. A car park contains 5 cars. The arrival of cars is Poisson at a mean rate of 10 per hour.
The length of time each car spends in the car park is exponential distribution with mean of 5
hours. How many cars are in the car park on an average?

204. Assuming for a period of 2 hours in a day (8-10 am) train arrive at the yard every 20
minutes, then calculate for this period. (i) the probability that the yard is empty. (ii) average
queue length assuming that the capacity of the yard is 4 trains only.

205. In a supermarket, the average arrival rate of customer is 8 every 30 minutes following
Poisson process. The average time taken by a cashier to list and calculate the customer's
purchase is 3 minutes following exponential distribution. What is the probability that the
queue length exceeds 8 ? What is the expected time spent by a customer in the system?

206. A TV repairman finds that the time spend on his jobs as an exponential distribution with
mean 40 minutes. If he repairs sets in the order in which they come in and if the arrival of
sets is approximately Poisson with an average rate of 12 per 10 hours day. What is repairman
expected idle time each day. How many jobs are ahead of the average set just brought in.
Find the basic solution and identifies the basic feasible solution.

207. Max z=x 1+ 2 x 2 +4 x 3

subject ¿ , 2 x 1 + x 2+ 4 x 3=11 ,
3 x 1+ x 2 +5 x 3=14 ,
x1 , x2 , x3 ≥ 0

208. Max z=x 1+ x 2 + x 4

subject ¿ , x 1 + x 2+ x3 + x 4 =4 ,
x 1+ 2 x 2 + x 3+ x5 =4 ,
x 1+ 2 x 2 + x 3=4 ,
x1 , x2 , x3 , x4 , x5 ≥ 0

209. Min z =x1 −2 x 2−3 x 3

subject ¿ ,−2 x 1 + x 2+3 x 3=2,
2 x1 +3 x 2 +4 x 3=1 ,
x1 , x2 , x3 ≥ 0

210. Max z=2 x1 +3 x 2+ 4 x 3 +7 x 4

subject ¿ , 2 x 1 +3 x2−x 3 + 4 x 4=8 ,
x 1−2 x2 +6 x 3−7 x 4 =−3 ,
x1 , x2 , x3 , x4 ≥ 0

211. Min z =2 x 1 +3 x 2−x 3+ 4 x 4

subject ¿ , x 1 + x 2+ 2 x 3−x 4 =6 ,
2 x1 + x 2 +2 x3 +2 x 4=10 ,
x1 , x2 , x3 , x4 ≥ 0

REDUCTION OF feasible solution to basic feasible solution.

212. (2,1,3) is a feasible solution of the set of equations

4x1+2x2 -3x3 = 1
6x1+4x2-5x3 = 1
Reduce it to a basic feasible solution of the set.

213. (2,4,5) is a feasible solution of the set of equations

2x1-x2 +2x3 = 10
 x1+4x2 = 18
Reduce it to a basic feasible solution of the set.

214. (2,4,1) is a feasible solution of the set of equations

2x1-x2 +2x3 = 2
x1+4x2 = 18
Reduce it to a basic feasible solution of the set.

215. (1,1,2) is a feasible solution of the set of equations

x1+2x2 +3x3 = 9
2x1-x2+x3 = 3
Reduce it to a basic feasible solution of the set.

216. Show that (0,2,3,4) is a Basic feasible solution of the set of equations
7x1+x2 +3x3 +3 x4 =23
7x1+2x2+4x3 + x4 = 20
14x1+3x2 +2x3 +9x4 =48
Whose feasible solution is (1,1,2,3)

217. Show that (1,2,0,1) is a Basic feasible solution of the set of equations
2x1+3x2 -2x3 -7 x4 =1
x1+x2+x3 + 3x4 = 6
x1-x2 +x3 +5x4 = 4
Find all basic solution.

218. (2,1,1) is a feasible solution of the set of equations

x1+4x2 -x3 = 5
2x1+3x2+x3 = 8
Reduce it to a basic feasible solution of the set.

219. (1,2,1,0) is a feasible solution of the set of equations

11x1+2x2 -9x3 +4 x4 =6
15x1+3x2-12x3 +5 x4 = 9

Reduce it to a basic feasible solution of the set.

220. Show that x1 = 5, x2 = 0, x3 = -1 is a basic solution of the given system of equations

x1+2x2 +x3 = 4
 2x1+x2+5x3 = 5
Find other basic solutions, if there be any.

Solve the game by graphical method.

221.
1 3 0 2
3 0 1 -1

222.
1 -4
2 3
-3 4
2 2

223.
6 5 2 3
1 2 6 3

224.
2 7
3 5
11 2
2 4

225.
2 3
-2 4
2 -1
1 5

226.
-1 3 2 2
6 2 5 3

227.
0 -2
7 -1
-1 4
-2 6
5 -3

228.
 2 2 3 -1
4 3 2 6

229.
1 -3
3 5
-1 6
4 1
2 2
-5 0

230.
2 1 0 -2
1 0 3 2

MACHINE SEQUENCING

231. Determine the optimal sequence of jobs which minimizes a total elapsed time based on
the following information. Processing time on the machines is given in hours and passing is
not allowed.

Job A B C D E F G
M1 3 8 7 4 9 8 7
M2 4 3 2 5 1 4 3
M3 6 7 5 11 5 6 12

232. Seven jobs go first over machine1 (M1) and then over machine (M2), processing time in
hours are given below:

Job A B C D E F G
M1 06 24 30 12 20 22 18
M2 16 20 20 12 24 02 06

Find the optimal sequence in which jobs should be processed.

233. six jobs go first over machine1 (M1) and then over machine (M2), processing time in
hours are given below:

Job A B C D E F
M1 1 3 8 5 6 3
M2 5 6 3 2 2 10

Find the optimal sequence in which jobs should be processed.

234. Five jobs go first over machine1 (M1) and then over machine (M2), processing time in
hours are given below:

Job A B C D E
M1 3 8 5 7 4
M2 4 10 6 5 8

Find the optimal sequence in which jobs should be processed.

235. Five jobs go first over machine1 (M1) and then over machine (M2) & (M3), processing
time in hours are given below:

Job A B C D E
M1 3 8 7 5 2
M2 3 4 2 1 5
M3 5 8 10 7 6

Find the optimal sequence in which jobs should be processed.

236. Five jobs go first over machine1 (M1) and then over machine (M2) & (M3), processing
time in hours are given below:

Job A B C D E
M1 7 12 11 9 8
M2 8 9 5 6 7
M3 11 13 9 10 14

Find the optimal sequence in which jobs should be processed.

237. Four jobs go first over machine1 (M1) and then over machine (M2) & (M3), processing
time in hours are given below:

Job A B C D
M1 6 5 4 7
M2 4 5 3 2
M3 1 3 4 2

Find the optimal sequence in which jobs should be processed.

238. Seven jobs go first over machine1 (M1) and then over machine (M2), processing time in
hours are given below:

Job A B C D E F G
M1 3 12 15 6 10 11 9
M2 8 10 10 6 12 1 3

Find the optimal sequence in which jobs should be processed

239. Seven jobs go first over machine1 (M1) and then over machine (M2), processing time in
hours are given below:

Job A B C D E F G
M1 6 24 30 12 20 22 18
M2 16 20 20 12 24 2 4

Find the optimal sequence in which jobs should be processed

240. Nine jobs go first over machine1 (M1) and then over machine (M2), processing time in
hours are given below:

Job A B C D E F G H I
M1 2 5 4 9 6 8 7 5 4
M2 6 8 7 4 3 9 3 8 11

Find the optimal sequence in which jobs should be processed

NETWORKING

241. A small project is composed of seven activities whose time estimates are listed in the
following table as follows
Activity 1-2 1-3 2-4 2-5 3-5 4-6 5-6
t0 1 1 2 1 2 2 3
tm 1 4 2 1 5 5 6
tp 7 7 8 1 14 8 15

a) Draw the network diagram

b) Find the critical path
c) What is probability the project is completed by not more than 4 weeks.
242. Construct the network diagram according to the following chart of activities and predecessor
activity
Activities A B C D E F G H I J K

Predecessor - - A A I,J,K B,D B,D F A G,H F

Activities

243. The following table shows the jobs of a network along with their time estimates, the
time estimates are in days:
JOB 1-2 1-6 2-3 2-4 3-5 4-5 5-8 6-7 7-8
to 3 2 6 2 5 3 1 3 4
tm 6 5 12 5 11 6 4 9 19
tp 15 14 30 8 17 15 7 27 28
a) Draw the project network.
b) Find the critical path.
c) Find the probability that the project is completed in 31 days.

244. Construct a network for each of the projects whose activities and their precedence
relationships are given below
Activity A B C D E F G H I
Immediate - - A,B B B A,B F,D F,D C,G
Predecessor

245. A small project is composed of nine activities whose time estimates are listed in the
following table as follows
Activity 1-2 1-3 1-4 2-5 3-6 2-6 4-7 5-7 6-7
t0 5 18 26 15 16 6 7 7 3
tm 10 22 40 25 20 12 12 9 5
tp 8 20 33 20 18 9 10 8 4

a) Draw the network diagram

b) Find the critical path
c) What is probability the project is completed in 41.5 days.

246. Construct the network diagram according to the following chart of activities and predecessor
activity
Activities A B C D E F G

Predecessor - - A A B C D,E
Activities
247. A small project is composed of eight activities whose time estimates are listed in the
following table as follows
Activity 1-2 2-3 2-4 3-5 4-6 5-6 5-7 6-7
t0 3 9 6 8 8 0 5 8
tm 3 6 4 6 6 0 4 5
tp 3 3 2 4 4 0 3 2

a) Draw the network diagram

b) Find the critical path
c) What is probability the project is completed in 41.5 days.

248. Construct the network diagram according to the following chart of activities and predecessor
activity. Find the critical path , critical activities and project duration.
Activities A B C D E F G H I J K L M

Predecessor - A B A D E - G J,H - A C,K I,L

Activities

Duration 6 4 7 2 4 10 2 10 6 13 9 3 5
(day)

249. A small project is composed of nine activities whose time estimates are listed in the
following table as follows
Jobs 1-2 1-3 2-3 2-5 3-4 3-6 4-5 4-6 5-6 6-7
Duration 15 15 3 5 8 12 1 14 3 14
(day)

Find the critical path , critical activities and project duration.

250. A small project is composed of nine activities whose time estimates are listed in the
following table as follows
Activity 1-2 1-6 2-3 2-4 3-5 4-5 6-7 5-8 7-8
t0 1 2 2 2 7 5 5 3 8
tm 7 5 14 5 10 5 8 3 17
tp 13 14 26 8 19 17 29 9 32

a) Draw the network diagram

b) Find the critical path
c) What is probability the project is completed in 41.5 days.