Resource Management Techniques MC9242 II MCA

MC9242 RESOURCE MANAGEMENT TECNI!UES

" T # C
$ % % $
UNIT I "INEAR #ROGRAMMING MO&E"S 9
Mathematical Formulation - Graphical Solution of linear programming models Simplex
method Artificial variable Techniques- Variants of Simplex method
UNIT II TRANS#ORTATION AN& ASSIGNMENT MO&E"S 9
Mathematical formulation of transportation problem- Methods for finding initial basic
feasible solution optimum solution - degenerac Mathematical formulation of
assignment models !ungarian Algorithm Variants of the Assignment problem
UNIT III INTEGER #ROGRAMMING MO&E"S 9
Formulation Gomor"s #$$ method Gomor"s mixed integer method %ranch and
bound technique&
UNIT I' SCE&U"ING () #ERT AN& C#M 9
'et(or) *onstruction *ritical $ath Method $ro+ect ,valuation and -evie(
Technique -esource Analsis in 'et(or) Scheduling
UNIT ' !UEUEING MO&E"S 9
*haracteristics of .ueuing Models $oisson .ueues - /M 0 M 0 12 3 /F#F4 0 5 0526
/M 0 M 0 12 3 /F#F4 0 ' 0 526 /M 0 M 0 *2 3 /F#F4 0 5 0 526 /M 0 M 0 *2 3 /F#F4 0 ' 0 52
models&
Tota* No+ o, #erio-s . 4/
- 1 -
Resource Management Techniques MC9242 II MCA
RESOURCE MANAGEMENT TECNI!UES MC9242
#art0A !uestions an- Ans1ers
UNIT0I
2+ 3hat is o4erations research5
4perations research is a stud of optimi7ation techniques& #t is applied decision theor&
4- is the application of scientific methods6 techniques and tools to problems involving
the operations of sstems so as to provide these in control of operations (ith optimum
solutions to the problem&
2+ "ist some a44*ications o, OR+
4ptimal assignment of various +obs to different machines and different operators&
To find the (aiting time and number of customers (aiting in the queue and
sstem in queuing model
To find the mimimum transportation cost after allocating goods from different
origins to various destinations in transportation model
8ecision theor problems in mar)eting6finance and production planning and
control&
$+ 3hat are the 6arious t74es o, mo-e*s in OR5
Models b function
i2 8escriptive model ii2 $redictive model iii2 'ormative model
Models b structure
i2 #conic model ii2 Analogue model iii2 Mathematical model
Models b nature of environment
i2 8eterministic model ii2 $robabilistic model
4+ 3hat are main characteristics o, OR5
,xamination of functional relationship from a sstem overvie(&
9tili7ation of planned approach
Adaptation of planned approach
9ncovering of ne( problems for stud
/+ Name some characteristics o, goo- mo-e*+
The number of assumptions made should be as fe( as possible
#t should be eas as possible to solve the problem
The number of variables used should be as fe( as possible&
#t should be more flexible to update the changes over a period of time (ithout
change in its frame(or)&
8+ 3hat are the -i,,erent 4hases o, OR5
Formulation of the problem
*onstruction of mathematical modeling
- : -
Resource Management Techniques MC9242 II MCA
8eriving the solution from the model
Validit of the model
,stablishing the control over the solution
#mplementation of the final solution&
9+ "ist out the a-6antages o, OR5
4ptimum use of managers production factors
#mproved qualit of decision
$reparation of future managers b improving their )no(ledge and s)ill
Modification of mathematical solution before its use&
:+ 3hat are the *imitations o, OR5
Mathematical model do not ta)e into account the intangible factors such as human
relations etc& can not be quantified&
Mathematical models are applicable to onl specific categories of problems&
-equires huge calculations& All these calculations cannot be handled manuall
and require computers (hich bear heav cost&
9+ 3hat is *inear 4rogramming5
;inear programming is a technique used for determining optimum utili7ation of
limited resources to meet out the given ob+ectives& The ob+ective is to maximi7e the profit
or minimi7e the resources /men6 machine6 materials and mone2
2%+ 3rite the genera* mathematica* ,ormu*ation o, "##+
1& 4b+ective function
Max or Min < = *
1
x
1
> *
:
x
:
> ?&&> *
n
x
n
:& Sub+ect to the constraints
a
11
x
1
>a
1:
x
:
>????> a
1n
x
n
/@=A2b
1
a
:1
x
1
>a
::
x
:
>????> a
:n
x
n
/@=A2b
:
??????????????????????&&
??????????????????????&&
a
m1
x
1
>a
m:
x
:
>????> a
mn
x
n
/@=A2b
m
B& 'on-negative constraints
x
1
6x
:
6?&x
m
A C
22+ 3hat are the characteristic o, "##5
There must be a (ell defined ob+ective function&
There must be alternative course of action to choose&
%oth the ob+ective functions and the constraints must be linear equation or
inequalities&
22+ 3hat are the characteristic o, stan-ar- ,orm o, "##5
The ob+ective function is of maximi7ation tpe&
All the constraint equation must be of equal tpe b adding slac) or surplus
variables
-!S of the constraint equation must be positive tpe
All the decision variables are of positive tpe
- B -
Resource Management Techniques MC9242 II MCA
2$+ 3hat are the characteristics o, canonica* ,orm o, "##5 ;NO' <%9=
#n canonical form6 if the ob+ective function is of maximi7ation tpe6 then all
constraints are of @ tpe& Similarl if the ob+ective function is of minimi7ation tpe6 then
all constraints are of A tpe& %ut non-negative constraints are Atpe for both cases&
24+ A ,irm manu,actures t1o t74es o, 4ro-ucts A an- ( an- se**s them at 4ro,it o,
Rs 2 on t74e A an- Rs $ on t74e (+ Each 4ro-uct is 4rocesse- on t1o machines M2
an- M2+T74e A requires 2 minute o, 4rocessing time on M2 an- 2 minutes on M2
T74e ( requires 2 minute o, 4rocessing time on M2 an- 2 minute on M2+ Machine
M2 is a6ai*a>*e ,or not more than 8 hours 4% minutes 1hi*e machine M2 is a6ai*a>*e
,or 2% hours -uring an7 1or?ing -a7+ @ormu*ate the 4ro>*em as a "## so as to
maAimiBe the 4ro,it+ ;MA) <%9=
Maximi7e 7 =:x
1
>Bx
:
Sub+ect tot the constraints3
x
1
> x
:
@ DCC
:x
1
> x
:


@ ECC
x
1
6x
:
A C
2/+ A com4an7 se**s t1o -i,,erent 4ro-ucts A an- ( C ma?ing a 4ro,it o, Rs+4% an-
Rs+ $% 4er unit on themCres4ecti6e*7+The7 are 4ro-uce- in a common 4ro-uction
4rocess an- are so*- in t1o -i,,erent mar?etsC the 4ro-uction 4rocess has a tota*
ca4acit7 o, $%C%%% man0hours+ It ta?es three hours to 4ro-uce a unit o, A an- one
hour to 4ro-uce a unit o, (+ The mar?et has >een sur6e7e- an- com4an7 o,,icia*
,ee* that the maAimum num>er o, units o, A that can >e so*- is :C%%% units an- that
o, ( is 22C%%% units+ Su>Dect to these *imitationsC 4ro-ucts can >e so*- in an7
com>ination+ @ormu*ate the 4ro>*em as a "## so as to maAimiBe the 4ro,it
Maximi7e 7 =DCx
1
>BCx
:
Sub+ect tot the constraints3
Bx
1
> x
:
@ BC6CCC
x
1
@ FCCC
x
:


@ 1:CCC
x
1
6x
:
A C
28+ 3hat is ,easi>i*it7 region5 ;MA) <%:=
*ollections of all feasible solutions are called a feasible set or region of an
optimi7ation model& Or A region in (hich all the constraints are satisfied is called
feasible region&
29+ 3hat is ,easi>i*it7 region in an "# 4ro>*em5 Is ti necessar7 that it shou*- a*1a7s
>e a con6eA set5
A region in (hich all the constraints are satisfied is called feasible region& The
feasible region of an ;$$ is al(as convex set&
2:+ &e,ine so*ution
A set of variables x16x:?&xn (hich satisfies the constraints of ;$$ is called a
solution&
29+ &e,ine ,easi>*e so*ution5 ;MA) <%9=
- D -
Resource Management Techniques MC9242 II MCA
An solution to a ;$$ (hich satisfies the non negativit restrictions of ;$$"s called the
feasible solution
2%+ &e,ine o4tima* so*ution o, "##+ ;MA) <%9=
An feasible solution (hich optimi7es the ob+ective function of the ;$$"s called
the optimal solution
22+ State the a44*ications o, *inear 4rogramming
Gor) scheduling
$roduction planning H production process
*apital budgeting
Financial planning
%lending
Farm planning
8istribution
Multi-period decision problem
#nventor model
Financial model
Gor) scheduling
22+ State the "imitations o, "#+
;$ treats all functional relations as linear
;$ does not ta)e into account the effect of time and uncertaint
'o guarantee for integer solution& -ounding off ma not feasible or optimal
solution&
8eals (ith single ob+ective6 (hile in real life the situation ma be difficult&
2$+ 3hat -o 7ou un-erstan- >7 re-un-ant constraints5
#n a given ;$$ an constraint does not affect the feasible region or solution space
then the constraint is said to be a redundant constraint&
24+ &e,ine Un>oun-e- so*ution5
#f the feasible solution region does not have a bounded area the maximum value
of < occurs at infinit& !ence the ;$$ is said to have unbounded solution&

2/+ &e,ine Mu*ti4*e O4tima* so*ution5
A ;$$ having more than one optimal solution is said to have alternative or
multiple optimal solutions&
28& 3hat is s*ac? 6aria>*e5
#f the constraint as general ;$$ be I= tpe then a non negative variable is
introduced to convert the inequalities into equalities are called slac) variables& The
values of these variables are interpretedas the amount of unused resources&
29+ 3hat are sur4*us 6aria>*es5
#f the constraint as general ;$$ be J= tpe then a non negative
is introduced to convert the inequalities into equalities are called the surplus variables&
- K -
Resource Management Techniques MC9242 II MCA

2:+ &e,ine (asic so*ution5
Given a sstem of m linear equations (ith n variables/mIn2&The solution obtained
b setting /n-m2 variables equal to 7ero and solving for the remaining m variables is
called a basic solution&
29& &e,ine non &egenerate (asic ,easi>*e so*ution5
The basic solution is said to be a non degenerate basic solution if 'one of the
basic variables is 7ero&
$%+ &e,ine -egenerate >asic so*ution5
A basic solution is said to be a degenerate basic solution if one or more of the
basic variables are 7ero&
$2+ 3hat is the ,unction o, minimum ratioL
To determine the basic variable to leave
To determine the maximum increase in basic variable
To maintain the feasibilit of follo(ing solution
$2+ @rom the o4timum sim4*eA ta>*e ho1 -o 7ou i-enti,7 that "## has un>oun-e-
so*ution5
To find the leaving variables the ratio is computed& The ratio is I=C
then there is an unbounded solution to the given ;$$&
$$+ @rom the o4timum sim4*eA ta>*e ho1 -o 7ou i-enti,7 that the "## has no
so*ution5
#f atleast one artificial variable appears in the basis at 7ero level (ith a >ve value
in the Mb column and the optimalit condition is satisfied
then the original problem has no feasible solution&
$4+ o1 -o 7ou i-enti,7 that "## has no so*ution in a t1o 4hase metho-5
#f all <+ *+ @ C H then atleast one artificial variable appears in the optimum
basis at non 7ero level the ;$$ does not possess an solution&
$/& 3hat -o 7ou un-erstan- >7 -egenerac75
The concept of obtaining a degenerate basic feasible solution in ;$$ is )no(n as
degenerac& This ma occur in the initial stage (hen atleast one basic variable is 7ero in
the initial basic feasible solution&
$8+ 3rite the stan-ar- ,orm o, "## in the matriA notation5
#n matrix notation the canonical form of ;$$ can be expressed as
Maximi7e < = *M/ob+ fn&2
Sub to AM I= b/constraints2 and M J= C /non negative restrictions2
Ghere * = /*16*:6?&&*n26

A = a11 a1: ?&& a1n M = x1 b = b1
a:1 a::?&& a:n 6 x: 6 b:
& & &
& & &
- E -
Resource Management Techniques MC9242 II MCA
am1 am:?& amn xn bn
$9+ &e,ine >asic 6aria>*e an- non0>asic 6aria>*e in *inear 4rogramming+
A basic solution to the set of constraints is a solution obtained b setting an n
variables equal to 7ero and solving for remaining m variables not equal to 7ero& Such m
variables are called basic variables and remaining n 7ero variables are called non-basic
variables+
$:+So*6e the ,o**o1ing "# 4ro>*em >7 gra4hica* metho-+ ;MA) <%:=
MaAimiBe B E8A
2
F4A
2
Su>Dect tot the constraints.
A
2
F A
2
G /
A
2
H :
A
2
CA
2
H %
$9+ &e,ine unrestricte- 6aria>*e an- arti,icia* 6aria>*e+ ;NO' <%9=
9nrestricted Variable 3A variable is unrestricted if it is allo(ed to ta)e on
positive6 negative or 7ero values
Artificial variable 34ne tpe of variable introduced in a linear program model in
order to find an initial basic feasible solutionN an artificial variable is used for
equalit constraints and for greater-than or equal inequalit constraints
UNIT0II
2+ &e,ine trans4ortation 4ro>*em+
#t is a special tpe of linear programming model in (hich the goods are shipped
from various origins to different destinations& The ob+ective is to find the best possible
allocation of goods from various origins to different destinations such that the total
transportation cost is minimum&
$+ &e,ine the ,o**o1ing. @easi>*e so*ution
A set of non-negative decision values xi+ /i=16:6?&mN +=16:?n2 satisfies the
constraint equations is called a feasible solution&
4+ &e,ine the ,o**o1ing. >asic ,easi>*e so*ution
A basic feasible solution is said to be basic if the number of positive allocations
are m>n-1&/ m-origin and n-destination2&#f the number of allocations are less than /m>n-
12 it is called degenerate basic feasible solution&
/+ &e,ine o4tima* so*ution in trans4ortation 4ro>*em
A feasible solution is said to be optimal6 if it minimi7es the total transportation
cost&
8+ 3hat are the metho-s use- in trans4ortation 4ro>*em to o>tain the initia* >asic
,easi>*e so*ution+
'orth-(est corner rule
;o(est cost entr method or matrix minima method
Vogel"s approximation method
- O -
Resource Management Techniques MC9242 II MCA
9+ 3rite -o1n the >asic ste4s in6o*6e- in so*6ing a trans4ortation 4ro>*em+
To find the initial basic feasible solution
To find an optimal solution b ma)ing successive improvements from the initial
basic feasible solution&
:+C 3hat -o 7ou un-erstan- >7 -egenerac7 in a trans4ortation 4ro>*emL /'4V "CO2
#f the number of occupied cells in a m x n transportation problem is less than
/ m>n-12 then the problem is said to be degenerate&
9+ 3hat is >a*ance- trans4ortation 4ro>*emI un>a*ance- trans4ortation 4ro>*em5
Ghen the sum of suppl is equal to demands6 then the problem is said to be
balanced transportation problem&
A transportation problem is said to be unbalanced if the total suppl is not equal
to the total demand&
2%+ o1 -o 7ou con6ert an un>a*ance- trans4ortation 4ro>*em into a >a*ance- one5
The unbalanced transportation problem is converted into a balanced one b
adding a dumm ro( /source2 or dumm column /destination2 (hichever is necessar&
The unit transportation cost of the dumm ro(0 column elements are assigned to 7ero&
Then the problem is solved b the usual procedure&
22+ EA4*ain ho1 the 4ro,it maAimiBation trans4ortation 4ro>*em can >e con6erte-
to an equi6a*ent cost minimiBation trans4ortation 4ro>*em+ ;MA) <%:=
#f the ob+ective is to maximi7e the profit or maximi7e the expected sales (e have
to convert these problems b multipling all cell entries b -1&'o( the maximi7ation
problem becomes a minimi7ation and it can be solved b the usual algorithm
22+ &etermine >asic ,easi>*e so*ution to the ,o**o1ing trans4ortation 4ro>*em using
*east cost metho-+ ;MA) <%9=
A ( C & SU##")
# 2 2 2 4 $%
! $ $ 2 2 /%
R 4 2 / 9 2%
&eman- 2% 4% $% 2%
2$+ &e,ine transshi4ment 4ro>*ems5
A problem in (hich available commodit frequentl moves from one source to
another source or destination before reaching its actual destination is called transshipment
problems&
24+ 3hat is the -i,,erence >et1een Trans4ortation 4ro>*em I Transshi4ment
#ro>*em5
#n a transportation problem there are no intermediate shipping points (hile in
transshipment problem there are intermediate shipping points
2/+ 3hat is assignment 4ro>*em5
An assignment problem is a particular case of a transportation problem in (hich a
number of operations are assigned to an equal number of operators (here each operator
- F -
Resource Management Techniques MC9242 II MCA
performs onl one operation6 the overall ob+ective is to maximi7e the total profit or
minimi7e the overall cost of the given assignment&

28+ EA4*ain the -i,,erence >et1een trans4ortation an- assignment 4ro>*ems5

Trans4ortation 4ro>*ems Assignment 4ro>*ems
12 suppl at an source ma be a Suppl at an source (ill
an positive quantit& be 1&

:2 8emand at an destination ma 8emand at an destination
be a positive quantit& (ill be 1&
B2 4ne or more source to an number 4ne source one destination&
of destination&
29+ &e,ine un>oun-e- assignment 4ro>*em an- -escri>e the ste4s in6o*6e- in
so*6ing it5
#f the no& of ro(s is not equal to the no& of column in the given cost matrix the
problem is said to be unbalanced& #t is converted to a balanced one b adding dumm ro(
or dumm column (ith 7ero cost&

2:+ EA4*ain ho1 a maAimiBation 4ro>*em is so*6e- using assignment mo-e*5
The maximi7ation problems are converted to a minimi7ation one of the follo(ing
method&
/i2 Since max 7 = min/-72
/ii2 Subtract all the cost elements all of the cost matrix from the
!ighest cost element in that cost matrix&
29+ 3hat -o 7ou un-erstan- >7 restricte- assignment5 EA4*ain ho1 7ou shou*-
o6ercome it5
The assignment technique6 it ma not be possible to assign a particular tas) to a
particular facilit due to technical difficulties or other restrictions& This can be overcome
b assigning a ver high processing time or cost /it can be 52 to the corresponding cell&
2%+ o1 -o 7ou i-enti,7 a*ternati6e so*ution in assignment 4ro>*em5
Sometimes a final cost matrix contains more than required number of 7eroes at
the independent position& This implies that there is more than one optimal solution (ith
some optimum assignment cost&
22+ 3hat is a tra6e*ing sa*esman 4ro>*em5
A salesman normall must visit a number of cities starting from his head quarters&
The distance bet(een ever pair of cities are assumed to be )no(n& The problem of
finding the shortest distance if the salesman starts from his head quarters and passes
through each cit exactl once and returns to the headquarters is called Traveling
Salesman problem&
22+ &e,ine route con-ition5
- P -
Resource Management Techniques MC9242 II MCA
The salesman starts from his headquarters and passes through each cit exactl
once&
2$+ Gi6e the areas o, o4erations o, assignment 4ro>*ems5
Assigning +obs to machines&
Allocating men to +obs0machines&
-oute scheduling for a traveling salesman&
24+ o1 -o 7ou con6ert the un>a*ance- assignment 4ro>*em into a >a*ance- one5
;MA) <%:=
Since the assignment is one to one basis 6 the problem have a square matrix& #f the
given problem is not square matrix add a dumm ro( or dumm column and then
convert it into a balanced one /square matrix2& Assign 7ero cost values for an dumm
ro(0column and solve it b usual assignment method&
UNIT0III
2+ &e,ine Integer #rogramming #ro>*em ;I##=5 ;&EC <%9=
A linear programming problem in (hich some or all of the variables in the optimal
solution are restricted to assume non-negative integer values is called an #nteger
$rogramming $roblem /#$$2 or #nteger ;inear $rogramming
2+ EA4*ain the im4ortance o, Integer 4rogramming 4ro>*em5
#n ;$$ the values for the variables are real in the optimal solution& !o(ever in
certain problems this assumption is unrealistic& For example if a problem has a solution
of F10: cars to be produced in a manufacturing compan is meaningless& These tpes of
problems require integer values for the decision variables& Therefore #$$ is necessar to
round off the fractional values&
$+ "ist out some o, the a44*ications o, I##5 ;MA) <%9= ;&EC <%9= ;MA) <%9=
#$$ occur quite frequentl in business and industr&
All transportation6 assignment and traveling salesman problems are #$$6 since the
decision variables are either <ero or one&
All sequencing and routing decisions are #$$ as it requires the integer values of
the decision variables&
*apital budgeting and production scheduling problem are $$& #n fact6 an
situation involving decisions of the tpe either to do a +ob or not to do can be
treated as an #$$&
All allocation problems involving the allocation of goods6 men6 machines6 give
rise to #$$ since such commodities can be assigned onl integer and not fractional
values&
4+ "ist the 6arious t74es o, integer 4rogramming5 ;MA) <%9=
- 1C -
Resource Management Techniques MC9242 II MCA
Mixed #$$
$ure #$$
/+ 3hat is 4ure I##5
#n a linear programming problem6 if all the variables in the optimal solution are
restricted to assume non-negative integer values6 then it is called the pure /all2 #$$&
8+ 3hat is MiAe- I##5
#n a linear programming problem6 if onl some of the variables in the optimal
solution are restricted to assume non-negative integer values6 (hile the remaining
variables are free to ta)e an non-negative values6 then it is called A Mixed #$$&
9+ 3hat is Jero0one 4ro>*em5
#f all the variables in the optimum solution are allo(ed to ta)e values either C or 1
as in Qdo" or Qnot to do" tpe decisions6 then the problem is called <ero-one problem or
standard discrete programming problem&
:+ 3hat is the -i,,erence >et1een #ure integer 4rogramming I miAe- integer
integer 4rogramming&
Ghen an optimi7ation problem6 if all the decision variables are restricted to ta)e
integer values6 then it is referred as pure integer programming& #f some of the variables
are allo(ed to ta)e integer values6 then it is referred as mixed integer integer
programming&
9+ EA4*ain the im4ortance o, Integer #rogramming5
#n linear programming problem6 all the decision variables allo(ed to ta)e an
non-negative real values6 as it is quite possible and appropriate to have fractional values
in man situations& !o(ever in man situations6 especiall in business and industr6
these decision variables ma)e sense onl if the have integer values in the optimal
solution& !ence a ne( procedure has been developed in this direction for the case of ;$$
sub+ected to additional restriction that the decision variables must have integer values&
2%+ 3h7 not roun- o,, the o4timum 6a*ues in stea- o, resorting to I#5 ;MA) <%:=
There is no guarantee that the integer valued solution /obtained b simplex
method2 (ill satisf the constraints& i&e& &6 it ma not satisf one or more constraints and
as such the ne( solution ma not feasible& So there is a need for developing a sstematic
and efficient algorithm for obtaining the exact optimum integer solution to an #$$&
22+ 3hat are metho-s ,or I##5 ;MA) <%:=
#nteger programming can be categori7ed as
/i2 *utting methods
/ii2 Search Methods&
22+ 3hat is cutting metho-5
A sstematic procedure for solving pure #$$ (as first developed b -&,&Gomor
in 1PKF& ;ater on6 he extended the procedure to solve mixed #$$6 named as cutting plane
algorithm6 the method consists in first solving the #$$ as ordinar ;$$&% ignoring the
integrit restriction and then introducing additional constraints one after the other to cut
certain part of the solution space until an integral solution is obtained&
- 11 -
Resource Management Techniques MC9242 II MCA
2$+ 3hat is search metho-5
#t is an enumeration method in (hich all feasible integer points are enumerated&
The (idel used search method is the %ranch and %ound Technique& #t also starts (ith
the continuous optimum6 but sstematicall partitions the solution space into sub
problems that eliminate parts that contain no feasible integer solution& #t (as originall
developed b A&!&;and and A&G&8oig&
24+ EA4*ain the conce4t o, (ranch an- (oun- Technique5
The (idel used search method is the %ranch and %ound Technique& #t starts
(ith the continuous optimum6 but sstematicall partitions the solution space into sub
problems that eliminate parts that contain no feasible integer solution& #t (as originall
developed b A&!&;and and A&G&8oig&
2/+ Gi6e the genera* ,ormat o, I##5
The general #$$ is given b
Maximi7e < = *M
Sub+ect to the constraints
AM @ b6
M A C and some or all variables are integer&
28+ 3rite an a*gorithm ,or Gomor7<s @ractiona* Cut a*gorithm5
1& *onvert the minimi7ation #$$ into an equivalent maximi7ation #$$ and all the
coefficients and constraints should be integers&
:& Find the optimum solution of the resulting maximi7ation ;$$ b using simplex
method&
B& Test the integrit of the optimum solution&
D& -e(rite each M
%i
K& ,xpress each of the negative fractions if an6 in the )
th
ro( of the optimum simplex
table as the sum of a negative integer and a non-negative fraction&
E& Find the fractional cut constraint
O& Add the fractional cut constraint at the bottom of optimum simplex table obtained in
step :&
F& Go to step B and repeat the procedure until an optimum integer solution is obtained&
29+ 3hat is the 4ur4ose o, @ractiona* cut constraints5
#n the cutting plane method6 the fractional cut constraints cut the unuseful area of
the feasible region in the graphical solution of the problem& i&e& cut that area (hich has no
integer-valued feasible solution& Thus these constraints eliminate all the non-integral
solutions (ithout loosing an integer-valued solution&
2:+A manu,acturer o, >a>7 -o**s ma?es t1o t74es o, -o**sC -o** K an- -o** )+
#rocessing o, these -o**s is -one on t1o machines A an- (+ &o** K requires 2 hours
on machine A an- 8 hours on Machine (+ &o** ) requires / hours on machine A an-
/ hours on Machine (+ There are 28 hours o, time 4er -a7 a6ai*a>*e on machine A
an- $% hours on machine (+ The 4ro,it is gaine- on >oth the -o**s is same+ @ormat
this as I##5
- 1: -
Resource Management Techniques MC9242 II MCA
;et the manufacturer decide to manufacture x
1
the number of doll M and x
:
number of doll R so as to maximi7e the profit& The complete formulation of the #$$ is
given b
Maximi7e < = x
1
>x
:
Sub+ect to : x
1
> K x
:
@1E
E x
1
> K x
:
@BC
and AC and are integers&
29+ EA4*ain Gomor7<s MiAe- Integer Metho-5
The problem is first solved b continuous ;$$ b ignoring the integrit condition&
#f the values of the integer constrained variables are integers6 then the current solution is
an optimal solution to the given mixed #$$& ,lse select the source ro( (hich corresponds
to the largest fractional part among these basic variables (hich are constrained to be
integers& Then construct the Gomarian constraint from the source ro(& Add this
secondar constraint at the bottom of the optimum simplex table and use dual simplex
method to obtain the ne( feasible optimal solution& -epeat this procedure until the values
of the integer restricted variables are integers in the optimum solution obtained&
2%+ 3hat is the geometrica* meaning o, 4ortione- or >ranche- the origina*
4ro>*em5
Geometricall it means that the branching process eliminates portion of the
feasible region that contains no feasible-integer solution& ,ach of the sub-problems
solved separatel as a ;$$&
22+ 3hat is stan-ar- -iscrete 4rogramming 4ro>*em5
#f all the variables in the optimum solution are allo(ed to ta)e values either C or 1
as in Qdo" or Qnot to do" tpe decisions6 then the problem is called standard discrete
programming problem&
22+ 3hat is the -isa-6antage o, >ranche- or 4ortione- metho-5
#t requires the optimum solution of each sub problem& #n large problems this could
be ver tedious +ob&
2$+ o1 can 7ou im4ro6e the e,,icienc7 o, 4ortione- metho-5
The computational efficienc of portioned method is increased b using the
concept of bounding& % this concept (henever the continuous optimum solution of a sub
problem ields a value of the ob+ective function lo(er than that of the best available
integer solution it is useless to explore the problem an further consideration& Thus once
a feasible integer solution is obtained6 its associative ob+ective function can be ta)en as a
lo(er bound to delete inferior sub-problems& !ence efficienc of a branch and bound
method depends upon ho( soon the successive sub-problems are fathomed&
UNIT0I'
2+ 3hat -o 7ou mean >7 4roDect5
A pro+ect is defined as a combination on inter related activities (ith limited
resources namel men6 machines materials6 mone and time all of (hich must be
executed in a defined order for its completion+
- 1B -
Resource Management Techniques MC9242 II MCA
2+ 3hat are the three main 4hases o, 4roDect5
$lanning6 Scheduling and *ontrol
$+ 3hat are the t1o >asic 4*anning an- contro**ing techniques in a net1or?
ana*7sis5
*ritical $ath Method /*$M2
$rogramme ,valuation and -evie( Technique /$,-T=
4+ 3hat are the a-6antages o, C#M an- #ERT techniques5
#t encourages a logical discipline in planning6 scheduling and control of pro+ects
#t helps to effect considerable reduction of pro+ect times and the cost
#t helps better utili7ation of resources li)e men6machines6materials and mone
(ith reference to time
#t measures the effect of delas on the pro+ect and procedural changes on the
overall schedule&
/+ 3hat is the -i,,erence C#M an- #ERT
*$M
'et(or) is built on the basis of activit
8eterministic nature
4ne time estimation
$,-T
An event oriented net(or)
$robabilistic nature
Three time estimation
8+ 3hat is net1or?5
A net(or) is a graphical representation of a pro+ect"s operation and is composed
of all the events and activities in sequence along (ith their inter relationship and inter
dependencies&
9+ 3hat is E6ent in a net1or? -iagram5
An event is specific instant of time (hich mar)s the starts and end of an activit&
#t neither consumes time nor resources& #t is represented b a circle&
:+ &e,ine acti6it75
A pro+ect consists of a number of +ob operations (hich are called activities& #t is
the element of the pro+ect and it ma be a process6 material handling6 procurement ccle
etc&
9+ &e,ine Critica* Acti6ities5
#n a 'et(or) diagram critical activities are those (hose if consumer more than
estimated time the pro+ect (ill be delaed&

2%+ &e,ine non critica* acti6ities5
- 1D -
Resource Management Techniques MC9242 II MCA
Activities (hich have a provision such that the event if the consume a specified
time over and above the estimated time the pro+ect (ill not be delaed are termed as non
critical activities&
22+ &e,ine &umm7 Acti6ities5
Ghen t(o activities start at a same time6 the head event are +oined b a dotted
arro( )no(n as dumm activit (hich ma be critical or non critical&
22+ &e,ine -uration5
#t is the estimated or the actual time required to complete a trade or an activit&

2$+ &e,ine tota* 4roDect time5
#t is time ta)en to complete to complete a pro+ect and +ust found from the
sequence of critical activities& #n other (ords it is the duration of the critical path&
24+ &e,ine Critica* #ath5
#t is the sequence of activities (hich decides the total pro+ect duration& #t is
formed b critical activities and consumes maximum resources and time&
2/+ &e,ine ,*oat or s*ac?5 ;MA) <%:=
Slac) is (ith respect to an event and float is (ith respect to an activit& #n other
(ords6 slac) is used (ith $,-T and float (ith *$M& Float or slac) means extra time over
and above its duration (hich a non-critical activit can consume (ithout delaing the
pro+ect&
28+ &e,ine tota* ,*oat5 ;MA) <%:=
The total float for an activit is given b the total time (hich is available for
performance of the activit6 minus the duration of the activit& The total time is available
for execution of the activit is given b the latest finish time of an activit minus the
earliest start time for the activit& Thus
Total float = ;atest start time earliest start time&
29+ &e,ine ,ree ,*oat5 ;MA) <%:=
This is that part of the total float (hich does not affect the subsequent activities&
This is the float (hich is obtained (hen all the activities are started at the earliest&

2:+ &e,ine In-e4en-ent ,*oat5 ;MA) <%9= ;MA) <%:=
#f all the preceding activities are completed at their latest6 in some cases6 no float
available for the subsequent activities (hich ma therefore become critical&
#ndependent float = free tail slac)&
29+ &e,ine Inter,ering ,*oat5
Sometimes float of an activit if utili7ed (holl or in part6 ma influence the
starting time of the succeeding activities is )no(n as interfering float&
#nterfering float = latest event time of the head - earliest event time of
the event&
- 1K -
Resource Management Techniques MC9242 II MCA
2%+ &e,ine O4timistic5
4ptimistic time estimate is the duration of an activit (hen everthing goes on
ver (ell during the pro+ect&

22+ &e,ine #essimistic5
$essimistic time estimate is the duration of an activit (hen almost everthing
goes against our (ill and a lot of difficulties is faced (hile doing a pro+ect&
22+ &e,ine most *i?e*7 time estimation5
Most li)el time estimate is the duration of an activit (hen sometimes thing go
on ver (ell6 sometimes things go on ver bad (hile doing the pro+ect&
24+ 3hat is a 4ara**e* critica* 4ath5
Ghen critical activities are crashed and the duration is reduced other paths ma
also become critical such critical paths are called parallel critical path&

2/+ 3hat is stan-ar- -e6iation an- 6ariance in #ERT net1or?5 ;NO' <%9=
The expected time of an activit in actual execution is not completel reliable and
is li)el to var& #f the variabilit is )no(n (e can measure the reliabilit of the expected
time as determined from three estimates& The measure of the variabilit of possible
activit time is given b standard deviation6 their probabilit distribution
Variance of the activit is the square of the standard deviation
28+ Gi6e the -i,,erence >et1een -irect cost an- in-irect cost5 ;NO' <%9=
8irect cost is directl depending upon the amount of resources involved in the
execution of all activities of the pro+ect& #ncrease in direct cost (ill decrease in pro+ect
duration& #ndirect cost is associated (ith general and administrative expenses6 insurance
cost6 taxes etc& #ncrease in indirect cost (ill increase in pro+ect duration&
UNIT0'
2+ &e,ine Len-a*<s notation ,or re4resenting queuing mo-e*s+
A queuing model is specified and represented smbolicall in the form /a0b0c2 3
/d0e2
Ghere a- inter arrival time
b-service mechanism
c-number of service
d-the capacit of the sstem
e-the queue discipline
2+ In a su4er mar?etC the a6erage arri6a* rate o, customer is / in e6er7 $% minutes
,o**o1ing #oisson 4rocess+ The a6erage time is ta?en >7 the cashier to *ist an-
- 1E -
Resource Management Techniques MC9242 II MCA
ca*cu*ate the customer<s 4urchase is 4+/ minutesM ,o**o1ing eA4onentia* -istri>ution+
3hat is the 4ro>a>i*it7 that the queue *ength eAcee-s /5
Arrival rate= K0BC min
Service rate=:0Pmin
$robabilit that the queue length exceeds K = /S2
n>:
= /&OK2
O
=C&1BB
$+ EA4*ain !ueue -isci4*ine an- its 6arious ,orms+
/i2 F#F4 or F*FS - First #n First 4ut or First *ome First Served&
/ii2 ;#F4 or ;*FS - ;ast #n First 4ut or ;ast *ome First Served&
/iii2 S#-4 - Selection for service in random order&
/iv2 $#- - $riorit in selection
4+ &istinguish >et1een transient an- stea-7 state queuing s7stem+
A sstem is said to be in transient state (hen its operating characteristics are dependent
on time& A stead state sstem is one in (hich the behavior of the sstem is independent
of time&
/& &e,ine stea-7 state5
A sstem is said to be in stead state (hen the behavior of the sstem
independent of time& ;et p
n
/t2 denote the prob that there are Qn" units in the sstem at
time t& then in stead state=J lim p
n
T/ t 2=C

tU5
8+ 3rite -o1n the *itt*e ,ormu*a5
;
s
=;
q
>V0W
Ghere ;
s
= the average no& of customers in the sstem
;
q
= the average no& of customers in the queue
9+ I, tra,,ic intensit7 o, MNMNI s7stem is gi6en to >e %+98C 1hat 4ercent o, time the
s7stem 1ou*- >e i-*e5
Traffic intensit = C&OE /bus time2
Sstem to be idle = 1-C&OE =C&:D
:+ 3hat are the >asic e*ements o, queuing s7stem5
Sstem consists of the arrival of customers6 (aiting in queue6 pic) up for service
according to certain discipline6 actual service and departure of customer&
9+ 3hat is meant >7 queue -isci4*ine5
The manner in (hich service is provided or a customer is selected for service is
defined as the queue discipline+
2%+ 3hat are the c*assi,ications o, queuing mo-e*s5
m X m X # X5 m X m X # Xn m X m X cX5 m X m X c Xn
22+ 3hat are the characteristic o, queuing 4rocess5
Arrival pattern of customers6 service pattern of servers6 queue discipline6
sstem capacit6 no& of service channels6 no& of service stage&
22+ &e,ine #oisson 4rocess5
- 1O -
Resource Management Techniques MC9242 II MCA
The $oisson process is a continuous parameter discrete state process /ie2 a good
model for man practical situations& if M/t2represents the no& of 4ccurrences of a certain
in /C6 t2 then the discrete random process YM /t2Z is called the $oisson process& if it
satisfies the follo(ing postulates
#& $[1 occurrence in /t6t>\t2] =V\t > 4/\t2
##& $[C occurrence in /t6t>\t2] =1-V\t > 4/\t2
###& $[: or more occurrence in /t6t>\t2] =4/\t2
#V& M/t2 is independent of the number of occurrences of the event in an
interval prior /or2 after the interval/C6t2
V& The prob that the event occurs a specified number of times in /t
C
6 t
C
>t2
depends onl on t but not on t
C&
2$+ Gi6en an7 t1o eAam4*es o, #oisson 4rocess5
1& The number of incoming telephone calls received in a particular time
:& The arrival of customer at a ban) in a da
24+ 3hat are the 4ro4erties o, #oisson 4rocess5
1& The $oisson process is a mar)ov process&
:& Sum of t(o independent poissen processes is a poisson process&
B& 8ifference of t(o independent poisson processes is not poisson process&
D& The inter arrival time of a poisson process has an exponential distribution
(ith mean 10V&
2/+ Customer arri6es at a one0man >ar>er sho4 accor-ing to a #oisson 4rocess 1ith
an mean inter arri6a* time o, 22 minutes+ Customers s4en- a a6erage o, 2% minutes
in the >ar>er<s chain+3hat is the eA4ecte- no o, customers in the >ar>er sho4 an-
in the queue5
Given mean arrival rate 10V = 1:&
Therefore V = 101: per minute&
Mean service rate 10W = 1C&
Therefore W = 101C per minute&
,xpected number of customers in the sstem
;
s
= V0W-V
= 101:0101C-101: = K customers&

28& &e,ine 4ure >irth 4rocess5
#f the death rates W) = C for all ) = 16 :?? (e have a pure birth process&
1O+ 3rite -o1n the 4ostu*ates o, >irth an- -eath 4rocess5
12 p [1 birth /t6 t > \t2] = Vn/t2\t > C/\t2
:2 p [C birth in /t6 t > \t2] = 1 - Vn/t2\t > C/\t2&
B2 p [1 death in /t6 t > \t2] = Wn/t2\t > C/\t2
D2 p [C death in /t6 t > \t2] = 1 - Wn/t2\t > C/\t2&
2:+ 3hat is the ,ormu*a ,or the 4ro>*em ,or a customer to 1ait in the queue un-er
;mNmN2 NN@C@S=
G
s
= ;
s
0V&
- 1F -
Resource Management Techniques MC9242 II MCA
29+ 3hat is the a6erage num>er o, customers in the s7stem un-er
;mNmNe. ON@C@S=5
VW /V0W2
c
0 /c-12^/cW - V 2
:
> V0W&
2%+ 3hat is the -i,,erence >et1een 4ro>a>i*istic -eterministic an- miAe- mo-e*s5
$robabilistic3 Ghen there is uncertaint in both arrivals rate and service rate are
assumed to be random variables&
8eterministic3 %oth arrival rate and service rate are constants&
Mixed3 Ghen either the arrival rate or the service rate is exactl )no(n and the other is
not )no(n&
22+ 3hat are the assum4tions in mNmN2 mo-e*5
/i2 ,xponential distribution of inter arrival times or poisson distribution
of arrival rate&
/ii2 .ueue discipline is first come6 first serve&
/iii2 Single (aiting line (ith no restriction no length of queue&
/iv2 Single server (ith exponential distribution of service times&
22+ #eo4*e arri6e at a theatre tic?et >ooth in 4oisson -istri>ute- arri6a* rate o,
2/Nhour+ Ser6ice time is constant at 2 minutes+ Ca*cu*ate the mean5
V = :K0hr W = /_2EC = BC per hour&
S = V0W = :K0BC = K0E = C&FBB
;q = S
:
0 1-S = /&FBB2
:
0 1 - &FBB = D&1KKC:
Mean (aiting time=;q0V = D0:K = D0:K ` EC = P&E minutes&
28 Mar?s Unit 2
1. (a) Solve the LPP maximize Z=5x1 -2x2 +3x3
Subject to
- 1P -
Resource Management Techniques MC9242 II MCA
2x1 + 2x2 X3 = 2
3 x1 x2 = 3
X2 + 3x3 = 5
!"# x1$ x2$ x3 = %
2& ! com'a"( ')o#uce* t+o #i,,e)e"t ')o#uct* ! a"# -& .he com'a"( ma/e* a
')o,it o, 0*& % a"# 0*&3% 'e) u"it o" ! a"# - )e*'ectivel(& .he ')o#uctio"
')oce** ha* a ca'acit( o, 3%$%%% ma" hou)*& 1t ta/e* 3 hou)* to ')o#uce o"e
u"it o, ! a"# o"e hou) to ')o#uce o"e u"it o, -& .he ma)/et *u)ve( i"#icate*
that the maximum "umbe) o, u"it* ! that ca" be *ol# i* 2$%%% a"# tho* o, - i*
12$%%% u"it*& 3o)mulate the ')oblem a"# *olve it b( 4)a'hical metho# to 4et
maximum ')o,it&
(ii) 5)ite the al4o)ithm ,o) Sim'lex 6etho#
3&(a)7*e a)ti,icial va)iable tech"i8ue to *olve the ,ollo+i"4 LP ')oblem&
6aximize Z = X1 + 2X2 + 3X3 X
Subject to X1 + 2X2 + 3X3 = 15
2X1 + X2 + 5X3 = 2%
X1 + 2X2 + X3 + X = 1%
X1 $ X2 $ X3 $ X $ =%&
& ! ,i)m 'la"* to 'u)cha*e atlea*t 2%% 8ui"tal* o, *c)a' co"tai"i"4 hi4h 8ualit( metal
X a"# Lo+ 8ualit( metal 9& it #eci#e# that the *c)a' to be 'u)cha*e# mu*t co"tai"
atlea*t 1%% 8ui"tal* o, X-6etal a"# "o mo)e tha" 35 8ui"tal* o, 9 6etal& .he ,i)m ca"
'u)cha*e the *c)a' ,)om 2 *u''lie)* ( ! a"# - %i" u"limite# 8ua"titie*& .he : o, X a"#
9 metal* i" te)m* o, +ei4ht i" the *c)a' *u''lie* b( ! a"# - i* 4ive" belo+&
Meta*s Su44*ier A Su44*ier (
K 2/P 9/P
) 2%P 2%P
.he ')ice o, !;* *c)a' i* 0*& 2%% 'e) 8ui"tal a"# that o, -;* 0*& %% 'e) 8ui"tal&
<ete)mi"e the 8ua"titie* that it *houl# bu( ,)om the t+o *u''lie)* *o that total co*t i*
mi"imize# (7*e 4)a'hical metho#)&
28 Mar?s Unit 2
1 (i) Solve the ,ollo+i"4 t)a"*'o)tatio" ')oblem to maximize ')o,it
A ( C & Su44*7
2 4% 2/ 22 $$ 2%%
- :C -
Resource Management Techniques MC9242 II MCA
2 44 $/ $% $% $%
$ $: $: 2: $% 9%
&eman- 4% 2% 8% $%
2+ 3rite the a*gorithm ,or MO&I metho-
3& (i) 5)ite the al4o)ithm ,o) =u"4a)ia" metho#
(ii) ,ive +o)/e)* a)e available to +o)/ +ith the machi"e* a"# the )e*'ective co*t*
a**ociate# +ith each +o)/e)-machi"e a**i4"me"t i* 4ive" belo+& ! *ixth machi"e* i*
available to )e'lace o"e o, the exi*ti"4 machi"e* a"# the a**ociate# co*t* a)e al*o
4ive" belo+&
5o)/e)*
6achi"e*
61 62 63 6 65 6>
51 12 3 > - 5 2
52 11 - 5 - 3
53 2 2 1% ? @ 5
5 - @ 2 > 12 1%
55 5 2 ? > -
&etermine 1hether the ne1 machine can >e acce4te-+ &etermine a*so o4tima*
assignment an- the associate- sa6ing in the cost+
&(a)! ')o#uct i* ma"u,actu)e b( ,acto)ie* !$-$A$< .he u"it ')o#uctio" co*t* i"
them a)e 0*& 2 0*&3 a"# 0*&1 a"# 0*&5 )e*'ectivel(& .hei) ')o#uctio" ca'acitie* a)e
5%$ @%$ 3%$ a"# 5% u"it* )e*'ectivel( the*e ,acto)ie* *u''l( the ')o#uct to *to)e*$
#ema"#* o, +hich a)e 25$35$1%5 a"# 2% u"it* )e*'ectivel(& 7"it t)a"*'o)tatio" co*t i"
)u'ee* ,)om each ,acto)( to each *to)e i* 4ive" i" the table belo+B
Stores
2 2 $ 4
A 2 4 8 22
( 2% : 9 /
C 2$ $ 9 22
& 4 8 : $
<ete)mi"e the exte"t o, #elive)ie* ,)om each o, the ,acto)ie* to each o, the *to)e* *o
that the total ')o#uctio" a"# t)a"*'o)tatio" co*t i" mi"imum&
C0
5& ! cit( co)'o)atio" ha* #eci#e# to ca))( out )oa# )e'ai)* o" mai" a)te)ie* o, the
cit(& .he 4ovt ha* a4)ee# to ma/e a *'ecial 4)a"t o, 0*& 5% la/h to+a)#* the co*t +ith
a co"#itio" that the )e'ai)* be #o"e at the lo+e*t co*t a"# 8uic/e*t time& 1, the
co"#itio"* +a))a"t tha" a *u''leme"ta)( to/e" 4)a"t +ill al*o be co"*i#e)e#
,avo)abl( .he Ao)'o)atio" ha* ,loate# te"#e)* a"# 5 co"t)acto)* have *e"t i" thei)
bi#*& 1" o)#e) to ex'e#ite +o)/& 1 )oa# +ill be a+a)#e# to o"l( o" co"t)acto)&
- :1 -
Resource Management Techniques MC9242 II MCA
Cost o, Re4airs ;Rs+ "a?h=
R2 R2 R$ R4
C2 9 24 29 2/
C2 9 29 2% 29
C$ 9 2: 22 2:
C4 2% 22 2: 29
C/ 2% 2/ 22 28
i& ,i"# the be*t +a( o, a**i4"i"4 the )e'ai) +o)/ to the co"t)act a"# the
co*t*&
ii& 5hich o, the ,ive co"t)acto)* +ill be u"*ucce**,ul i" hi* bi#&
28 Mar?s Unit $
1& 7*e b)a"ch a"# bou"# metho# to *olve the ,ollo+i"4 i"te4e) ')o4)ammi"4
')oblem
6ax Z = 3x1 + x2
Subject to
@x1 + 1>x2 = 52
3x1 2x2 = 12
a"# x1$ x2 = a"# i"te4e)&
2& Solve the ,ollo+i"4 mixe# i"te4e) ')o4)ammi"4 ')oblem
6ax Z x1 + >x2 + 2x3
x1 = x2 = 5
-X1+ >X2 = 5
-X1 + X2 + X3 = 5
3&Solve the ,ollo+i"4 mixe#-i"te4e) ')o4)ammi"4 ')oblem b( u*i"4 Domo)(;* cutti"4
'la"e metho#&
6aximize z = X1 + X2
Subject to the co"*t)ai"t*B
3X1 + 2X2 = 5
X2 = 2
!"# X1 X2 = %E i* a" i"te4e)&
- :: -
Resource Management Techniques MC9242 II MCA
& Solve the ,ollo+i"4 all-1"te4e) ')o4)ammi"4 ')oblem u*i"4 the b)a"ch a"# bou"#
metho#&
6i"imize Z = 3X1 + 2&5X2
Subject to the co"*t)ai"t*
X1 + 2X2 = 2%
3X1 + 2X2 = 5%
28 Mar?s Unit 4
1 Aalculate the total ,loat$ ,)ee ,loat a"# i"#e'e"#e"t ,lot ,o) the ')oject +ho*e
activitie* a)e 4ive" belo+&
Acti6it7 202 20$ 20/ 20$ 204 $04 $0/ $08 408 /08
&uration :Q 9 22 4 2% $ / 2% 9 4
@in- the critica* 4ath a*so+
:& ! mai"te"a"ce ,o)ema" ha* 4ive" the ,ollo+i"4 e*timate o, time* a"# co*t o, job*
i" a mai"te"a"ce ')oject
Ro> #re-ecessor Norma* Crash
Time Cost Time Cost
A 0 : :% 8 2%%
( A 9 4% 4 94
C A 22 2%% / 2:4
& A 9 9% / 2%2
E (+C+& 8 /% 8 /%
Cve)hea# co*t i* 0*&25 'e) hou)
3i"#
(i) the "o)mal #u)atio" o, the ')oject a"# the a**ociate# co*t
(ii) A)a*h *(*tematicall( a"# ,i"# a**ociate# co*t
(iii) .he mi"imum #u)atio" o, the ')oject a"# it* co*t
(iv) 1, all the activitie* a)e c)a*he# +hat +ill be the ')oject #u)atio" a"# the
co))e*'o"#i"4 co*t
3& ! ')oject ha* the ,ollo+i"4 activitie* a"# othe) cha)acte)i*tic*B
Estimate- -uration ;in 1ee?s=
Acti6it7
O4timistic Most *i?e*7 #essimistic
;i D =
202 2 29 9
- :B -
Resource Management Techniques MC9242 II MCA
20$ 2 4 9
204 2 2 :
20/ 2 2 2
$0/ 2 / 24
408 2 / :
/08 $ 8 2/
i& +hat i* the ex'ecte# ')oject le"4thF
ii& 5hat i* the ')obabilit( that the ')oject +ill be com'lete# "o
mo)e tha" +ee/* late) tha" ex'ecte# timeF
&Li*te# i" the table ac)e the activitie* a"# *e8ue"ci"4 )e8ui)eme"t* "ece**a)( ,o) the
com'letio" o, )e*ea)ch )e'o)t
28 Mar?s Unit /
1&(i) Cbtai" the *(*tem o, *tea#( *tate e8uatio"* a"# he"ce ,i"# the value o, P i"
u*ual "otatio"* +he)e "G * a"# = *
(ii) ! 4e"e)al i"*u)a"ce com'a"( ha* th)ee claim a#ju*te)* i" it* b)a"ch o,,ice&
Peo'le +ith claim* a4ai"*t the com'a"( a)e ,ou"# to a))ive i" 'oi**o" ,a*hio" at a"
ave)a4e )ate o, 2% 'e) 2 hou) #a(& .he amou"t o, ti"e that a" a#ju*te) *'e"#* +ith a
claima"t i* ,ou"# to have "e4ative ex'o"e"tial #i*t)ibutio" +ith mea" *e)vice time %
mi"ute*& Alaima"t* a)e ')oce**e# i" the o)#e) o, thei) a''ea)a"ce& =o+ ma"( hou)* a
+ee/ ca" a" a#ju*te) ex'ect to *'e"# +ith claima"t* a"# ho+ much time$ o" the
ave)a4e #oe* claima"t *'e"# i" the b)a"ch o,,ice
2&(i) Hx'lai" va)iou* Iueuei"4 +ith exam'le
(ii) ! b)a"ch o, a "atio"al ba"/ ha* o"l( o"e t('i*t$ Si"ce the t('i"4 +o)/ va)ie* i"
le"4th$ the t('i"4 )ate i* )a"#oml( #i*t)ibute# a'')oximati"4 'oi**o" #i*t)ibutio"
+ith mea" )ate o, 2 lette)* 'e) hou)& .he lette) a))ive at a )ate o, 5 'e) hou) #u)i"4
the e"ti)e 2 hou) +o)/ #a(& 1, the t('e+)ite i* value# at 0*& 1&5% 'e) hou)& <ete)mi"e
e8ui'me"t utilizatio"$ the 'e)ce"t time a" a))ivi"4 lette) ha* to +ait$ ave)a4e
*(*tem time a"# ave)a4e i#le time co*t o, the t('e+)ite) 'e) #a(&
3& (a) !))ival* o, a tele'ho"e booth a)e co"*i#e)e# to be Poi**o" +ith a" ave)a4e time
o, 1% mi"ute* bet+ee" o"e a))ival a"# the "ext& .he le"4th o, 'ho"e call i* a**ume#
to be #i*t)ibute# ex'o"e"tiall($ +ith mea" 3 mi"ute*&
i& 5hat i* the ')obabilit( that a 'e)*o" a))ivi"4 at the booth +ill
have to +ait
- :D -
Resource Management Techniques MC9242 II MCA
ii& .he tele'ho"e #e'a)tme"t +ill i"*tall a *eco"# booth +he"
co"vi"ce# that a" a))ival +oul# ex'ect +aiti"4 ,o) atlea*t 3 mi"ute* ,o) a 'ho"e call&
-( ho+ much *houl# the ,lo+ o, a))ival* i"c)ea*e i" o)#e) to ju*ti,( a *eco"# boothF
iii& 5hat i* the ave)a4e le"4th o, the 8ueue that ,o)m ,)om time to
timeF
D& i& 5hat i* the ')obabilit( that a 'e)*o" a))ivi"4 at the booth +ill have to +ait
ii& .he tele'ho"e #e'a)tme"t +ill i"*tall a *eco"# booth +he"
co"vi"ce# that a" a))ival +oul# ex'ect +aiti"4 ,o) atlea*t 3 mi"ute* ,o) a 'ho"e call&
-( ho+ much *houl# the ,lo+ o, a))ival* i"c)ea*e i" o)#e) to ju*ti,( a *eco"# boothF
iii& 5hat i* the ave)a4e le"4th o, the 8ueue that ,o)m ,)om time to
timeF
- :K -
Resource Management Techniques MC9242 II MCA
- :E -
Resource Management Techniques MC9242 II MCA
Other 28 Mar?s
22+ a= i= 4ld hens can be bought at -s& : each and oung ones at -s K each& The old hens
la B eggs per (ee) and the oung one la K eggs per (ee)6 each egg being (orth BC
paise& A hen costs -s 1 per (ee) to feed& A person has onl -s FC to spend for hens&
!o( man of each )ind should he bu to give a profit of more than -s&E per (ee)6
assuming that he cannot house more than :C hensL Formulate this ;&$&$ H solve b
graphical methodL =
ii= ,xplain the follo(ing (ith respect to graphical method
'o Feasible solution6 9nbounded solution6 Alternate optimal solution

22 >= 9sing simplex algorithm

Min - : x
1
- x
:
Sub+ect to the constraints
x
1
> x
:
A :
x
1
> x
:
@ D and
x
1
6x
:
A C
22 a= A product is produced b four factories A6 %6 *6 and 8& The unit production costs
in them
are -s :6 -s B6 -s&1 and -s& K respectivel& Their production capacities are3
Factor A- KC
units6 %- OC units6 *- BC units and 8- KC units& These factories suppl the product
to four
stores6 demands of (hich are :K6 BK6 1CK and :C units respectivel& 9nit
transportation cost
in rupees from each factor to each store is given in the table belo(&
Stores
- :O -
Resource Management Techniques MC9242 II MCA
@actories
8etermine the extent of deliveries from each of the factories to each of the stores
so that the
total production and transportation cost is minimum& 9se VAM for finding the
initial basic
feasible solution&
22 >= i= #n the modification of the plant laout of a factor6 four ne( machines6 M16 M:6
MB and MD are to installed in a machine shop& There are five vacant places A6 %6 *6 8
and , available& %ecause of limited space6 machine M: cannot be placed at * and MB
cannot be placed at A& The cost of placing a machine at a particular is given belo(6 in
rupees& Find the optimal assignment schedule&
"ocation
A ( C & E
M2 P 11 1K 1C 11
M2 1: P - 1C P
Machine M$ - 11 1D 11 O
M4 1D F 1: O F
ii= Grite an algorithm to find an optimal solution for assignment problem
- :F -
2 2 $ 4
A : D E 11
( 1C F O K
C 1B B P 1:
& D E F B
Resource Management Techniques MC9242 II MCA
2$ a= Solve the follo(ing problem b the Gomor"s cutting plane method&
Max < = x
1
>x
:
Sub+ect to
Bx
1
> :x
:
@ K
x
:
@ :
and x
1
6x
:
A C and integers
2$ >= 9se branch and bound method to solve the follo(ing3
Max < = :x
1
>:x
:
Sub+ect to
Kx
1
> Bx
:
@ F
x
1
> : x
:
@ D
and x
1
6x
:
A C and integers
24 a= i= 8ra( the net(or) and determine the critical path for the follo(ing data& Also
calculate the
floats3
Ro>s. 1-: 1-B :-D B-D B-K D-K D-E K-E
&uration ;&a7s= E K 1C B D E : P
ii= *onstruct the net(or) for the pro+ect (hose precedence relationships are given belo(3
% I ,6 F N * I G6; N , 6 G I ! N ; 6! I # N ; I MN !6 M I ' N A I aN #6 a I $N $ I
.&
24 >= i= Assuming that the expected times are normall distributed6 find the probabilit
of meeting
the schedule date as given for the net(or)&
Acti6it7. 1-: 1-B :-D B-D D-K B-K
a : P K : E F
m K 1: 1D K E 1O
- :P -
Resource Management Techniques MC9242 II MCA
> 1D 1K 1O 1: 1: :C
Scheduled pro+ect completion date is BC das& Also find the date on (hich the
pro+ect manager can complete the pro+ect (ith a probabilit of C&PC or PCb
ii= 8istinguish bet(een $,-T and *$M&
2/ a= 4btain the sstem of stead state equations and hence find the value of p
n
in usual
notation
(here i2 n I s ii2 n A s&
2/ >= Ships arrive at a port at the rate of one in ever D hours (ith exponential
distribution of inter arrival times& The time a ship occupies a berth for unloading
has exponential distribution (ith an average of 1C hours& #f the average dela of
ships (aiting for berths is to )ept belo( 1D hours6 ho( man berths should be
provided at the portL
22 a= A farmer has 1CCC acres of land on (hich he can gro( corn6 (heat and soabeans&
,ach acre of corn costs -s 1CC per preparation6 O man das of (or) and ields a profit of
-s BC&An acre of (heat costs 1:CN requires 1C man-das (or)6 and ields a profit of
-s&DC&An acre of soabeans cost -s 1OC to prepare6 requires F man-das (or)6 and ields
a profit of -s :C&#f the former has -s& 1 la)h for preparation and can count on FCCC man-
das (or)& !o( man acres should be allocated to each crop to maximi7e profitL
Formulate this problem and solve it using the Simplex method& ;28=
22 >= 9se t(o-phase simplex method to
;28=
- BC -
Resource Management Techniques MC9242 II MCA
Minimi7e
<= 1K0: x
1
-Bx
:
Sub+ect to the constraints
Bx
1
- x
:
- x
B
A B
x
1
- x
:
> x
B
A :
x
1
6 x
:
6 x
B
A C
22 a= i= Solve the follo(ing transportation problem&
;2%=
&estination
# ! R S Su44*7
A :1 1E :K 1B 11
Source ( 1O 1F 1D :B 1B
C B: :O 1F D1 1P
&eman- E 1C 1: 1K
ii= Grite M48# method to solve the transportation problem&
;%8=
Or
22 >= The o(ner of a small machine shop has four mechanics available to assign +obs for
the da& Five +obs are offered (ith expected profit for each mechanic on each +ob (hich
are as follo(s3
Ro>
A ( C & E
2 E: OF KC 111 F:
Mechanic 2 O1 FD E1 OB KP
$ FO P: 111 O1 F1
4 DF ED FO OO FC
Find b using the assignment method6 the assignment of mechanics to the +ob that (ill
result in a maximum profit& Ghich +ob should be declinedL
;28=
- B1 -
Resource Management Techniques MC9242 II MCA
2$ a= Find the optimum integer solution using cutting plane algorithm for the follo(ing3
;28=
Maximum < = x
1
> : x
:
Sub+ect to
x
1
> x
:
@ O
: x
1
@ D
: x
:
@ O
x
1
6x
:
A C and integers&
Or
2$ >= 9se branch and bound method to solve the follo(ing3
;28=
Max < =B x
1
>:x
:
Sub+ect to the constraints
:x
1
> :x
:
@ O
x
1
@ :
x
:
@ :
and x
1
6x
:
A C and integers
24 a= The follo(ing table sho(s the +obs of a pro+ect (ith their duration in das& 8ra(
the net(or) and determine the critical path& Also calculate all the floats&
;28=
aobs 1-: 1-B 1-D :-K B-O D-E K-O K-F
8uration 1C F P F 1E O O O
aobs E-O E-P O-1C F-1C P-1C 1C-11 11-1:
8uration F K 1: 1C 1K F K
Or
24 >= A maintenance foreman has given the follo(ing estimate of times and cost of +obs
in a
maintenance pro+ect&
;28=
- B: -
Resource Management Techniques MC9242 II MCA
aob $redecessor 'ormal Time 'ormal *ost *rash Time *rash
*ost
A - F FC E 1CC
% A O DC D PD
* A 1: 1CC K 1FD
8 A P OC K 1C:
, %6 *6 8 E KC E KC

4verhead cost is -s& :K per hour
i2 The normal duration of the pro+ect and the associated cost
ii2 The minimum duration of the pro+ect and associated cost
iii2 #f all the activities are crashed (hat (ill be the pro+ect duration and the
corresponding cost&
2/ a= i= For the queuing model /M0M0S23 /50F#F426 derive the formula for average
(aiting time of
a customer in the sstem
;%8=
ii= For the model /M0M0123 /'0 F#F426 derive the formula for average number of
customers in
the sstem&
;%8=
iii= ,xplain the various characteristics of queuing sstems in detail&
;%4=
Or
>= *ustomers arrive at one-man barber shop according to a $oisson process (ith a mean
- BB -
Resource Management Techniques MC9242 II MCA
interval time of 1: min&*utomers spend an average of 1C minutes in the barber"s
chair&
1& Ghat is the expected number of customers in the barber shop and in the
queueL
:& *alculate the percentage of time an arrival can (al) straight into the
barber"s chair
(ithout having to (ait&
B& Ghat is the probabilit that the (aiting time in the sstem is greater than BC
minL
D& Management (ill provide another chair and hire another barber6 (hen a
customer"s
(aiting time in the shop exceeds 1&1K hours& !o( much the average rate of
arrivals
increase to (arrant a second barberL
;28=
28
- BD -