byjusexamprep.

com

1
byjusexamprep.com

CONSTRUCTION PROJECT MANAGEMENT

1 PROJECT MANAGEMENT

1. INTRODUCTION

Project Management deals with both 'material' as well as 'human factors' to increase the
productivity.
Objectives of a Project:
• It should be completed in minimum time with minimum capital investment
• It should use available manpower and other resources optimally.
1.1. Phases of Project Management
1.1.1. Planning
Planning involves:
1. Defining objectives of the project.
2. Listing of jobs that have to be performed.
3. Determining gross requirements for materials, equipment’s and man power and
preparing estimates of costs and duration for various jobs.
4. To bring about the satisfactory completion of project.
1.1.2. Scheduling
Scheduling is the allocation of resources such as time. material, space, equipment and
human and technological effort.
It involves:
1. Finalizing the planned functions mechanically.
2. Assigning starting and completion dates to each activity to proceed in a logical
sequence and in a systematic manner.
1.1.3 Controlling
Controlling involves:
1. Determination of deviations from basic plan and their effects on the project.
• It should be noted that planning and scheduling are accomplished before the actual
protect starts while controlling is operative during execution of the project.
The method of planning and controlling that was originally developed was called Project
Planning and Scheduling (PPS). PPS was later on converted into Critical Path Method
(CPM), so the CPM involves the deterministic approach and is used for the repetitive types
of projects.
1.2. Techniques Used for Project Management
1.2.1. Bar Chart
2
byjusexamprep.com
Firstly introduced by Henry Gantt around 1900 AD.

Features of bar chart are:

1. It is a pictorial chart
2. It has two coordinate axes, the horizontal coordinate represents the elapsed time and
vertical coordinate represents the job or activity to be performed.
3. The beginning and end of each bar represents starting and finishing time of a particular
activity respectively.
4. The length of bar shows the time required for completion.
• Jobs can be concurrent or can be started one after other. So some bars can run parallel
or overlap each other or may run serially.
Limitations of bar chart:
1. Lack of degree of details: Only major activities are shown in bar chart and sub-activities
cannot be separated out. Hence effective control over the activities in big projects cannot
be achieved.
2. A bar chart does not show progress of work and hence it cannot be used as a control
device.
3. A bar chart is unable to depict interdependencies of various activities clearly.
4. Bar charts are not useful in the projects where there are uncertainties in determination
of estimation of time required for completion of various activities such as in R&D projects.
5. Bar chart cannot distinguish between critical and noncritical activities and hence
resource smoothening and resource levelling cannot be done. Bar chart diagrams are
useful for only smaller and simpler conventional projects, especially construction and
manufacturing projects, in which time estimates can be made with fair degree of
certainty.
1.2.2. Mile-Stone Chart
• It is a modification over original Gantt chart. Milestones are key events of main
activities represented by bar. Therefore they give idea about completion of sub-activities.

3
byjusexamprep.com

2. NETWORK METHODS

• It is an outcome of the improvements in the milestone charts.

• They are called by various names such as PERT. CPM, UNETICS, LESS, TOPS and SCANS.
• However all these have emerged from the two major network systems viz:
1. PERT
2. CPM
2.1. Network Diagram and Techniques Network:
• It is the flow of diagram consisting of activities and events connected logically and
sequentially.
• Network diagram are of two types:
(i) Activity-on-Arrow Network (A-O-A)
(ii) Activity-on-Node Network (A-O-N) Advantages of network method over bar chart
and milestone chart:
1. Interrelationships between activities and events of a project are clearly shown.
2. The project can be treated as an integrated whole with all its sub-activities clearly
related with each other. It helps in controlling the project.
3. Network method is useful for very complicated projects having large number of
activities.
4. It indicates the time required in between two activities in which rescheduling of a
project is possible.
5. Time uncertainty is accounted for and so it is also useful for research and development
projects.
2.2. Elements of a Network
2.2.1. Event
• An event is either start or completion of an activity.
• Events are significant points in a project which act as control points of the project.
• An event is an instant of time and it does not require time or resources.
Following are examples of an event:
1. All parts assembled
4
byjusexamprep.com
2. A budget prepared
3. Construction completed
Following con not be events:
1. Prepare budget
2. Assemble pals
3 Excavate trench
• Events are represented by nodes in a network. It may have any of the following shapes
(I) Circular

(ii) Square

(iii) Rectangular

(iv) Oval

Different Shapes for Events

Most commonly adopted shape for events is circular shape.
• Tail event or the start event:
It makes beginning of an activity.
If it is the first event of project then known as 'initial as start event".
It has only outgoing arrow. e.g. Event 10 is a tail event. Arrows represent job or activity
of the project.

5
byjusexamprep.com
• Head event or the final event:
The event which marks the completion of an activity is known as 'head event".
If this event represents completion of entire project then it is called "Finish event'.
It has only incoming arrows.
E, g.: Event 20 is a head event.

Head Event
(i) When a tail event represents beginning of more than one activity, then the event is
said to occur when the first activity starts from it.
(ii) Similarly, when a head event occurs at end of more than one activity, the event is
said to have occurred only when all the activities leading to it are completed.
• Dual role events: All events except the first and the last event of a project are dual role
events. They have both incoming and outgoing arrows.

Dual Role Events

e.g.: Events 2, 3 and 4, are dual role events.
• Successor events: The event or events that follow another event are called successor
events to that event.

Successor Events
e g.: Event 2 and 3 are successor events of event 1
• Predecessor events: The event or events that occur before another event are called
predecessor oven' to that event.
In above figure. events 2. 3 are predecessor to event 5
2.2.2. Activity
Activity is actual performance of a job. It requires lime and resources for its completion.
Following are examples elan activity:
1. Excavate trench
2. Mix concrete
3. Prepare budget

6
byjusexamprep.com
In A-0-A system (Activity On Arrow network system), activity is represented by arrows
between events while in A-O-N (Activity On Node system), activities are represented by
nodes. In A-0-N system, events have no places.

Here A & B activities are represented in two different systems.

• The activities which can be performed simultaneously are and independent of each other
called as parallel activities. In above figure, activities A & Bare parallel activities.
• Activity or activities that can be performed after performance of other activity are known
as successor activities to that activity. Activity F is successor activity to activity C in above
figure.

• Similarly activities that are required to be performed before another activity can begin
are called predecessor activities to that activity. Activity (A) is predecessor activity to
activity D.
2.2.3. Dummy
• A dummy is a type of operation which neither requires time nor any resource, but it
denotes dependency among the activities.
• It is represented by dashed arrow.
In the figure shown below, a dummy activity is shown.

• Dummy is used to serve following purposes:

1. Grammatical purpose:
To prevent two arrows having common beginning and common end.

7
byjusexamprep.com

(a) Ambiguous Representation

(b) Grammatically Clean Representation

2. Logical purpose:
To show relationship with other activities.
Here dummy is required to show that activity D can start after completion activities of A
& B both

• Unnecessary dummies should be avoided.

∙ Dummies are used to show predecessor relation but if that relation is already
established in the network, then that dummy is redundant and has to be removed.
∙ If dummy is only incoming/outgoing arrow to/from a node then it can be remove
provided there is no logical or grammatical error.
2.3. Rules of a Network
1. There can be only one initial and one final event.
2. An event cannot occur unless all preceding activities are completed.
3. An event cannot occur twice.
4. Number of arrows should be equal to number of activities.
5. Time should always flow from left to right.
6. Length of arrow does not show any magnitude. Straight arrows should be taken as far
as possible.

8
byjusexamprep.com
7. Arrows should normally not cross each other. If it is necessary to cross, one should be
bridged over the other.
8. No activity can start until its tail event has occurred.
Fulkerson’s rule for numbering the events:
1. The single initial event is numbered as 0, 1, 10 etc.
2. All arrows emerging out of the initial event are neglected. Doing so, the created one
or more new initial events are numbered as 2,3,4 or 20, 30, 40 etc.
3. Step - 2 is repeated unless all events are numbered.
Errors in Network
1. Looping error: Loops should not be formed.

2. Dangling error:
Project is complete only when all its activities are complete but the duration of activity 'R
has no effect on the project time as shown in figure.

To avoid dangling error, the network must be examined in such a manner that all events
except initial and final events must have at least one activity entering and one activity
leaving them.
3. Wagon wheel error: As shown in figure below, each of the activities P, 0 and R cannot
start until all the three activities A, B and C are completed. But in reality, this may not be
the situation. There is no error visible in the construction of diagram but logical error has
crept into it.

3. PROGRAMME EVALUATION AND REVIEW TECHNIQUE (PERT)

• PERT stands for" Project/Programme Evaluation and Review Technique”

• PERT involves uncertainty into the project completion time.

9
byjusexamprep.com
• It is a numerical technique used in the projects in which time cannot be estimated accurately
such as research and development projects. It is an event oriented network. Cost is assumed
to be directly proportional to time.
Three time estimates are made in PERT:
1. Optimistic time (to): This is the minimum possible time in which an activity can be
completed under the most ideal conditions
2. Pessimistic time (tp): This is the maximum time required to complete an activity under the
worst possible conditions.
3. Most likely time (tm): This is the time required to complete an activity under normal working
conditions. Its value lies between to and tp. It is near to the expected time.
• In PERT each activity is assumed to follow Beta-distribution curve of time.
• This is calculated from β - distribution curve of time at which probability of activity is just
50%. Time taken by various activities follow β-distribution.
Hence value of expected time Is calculated by weighted average as.

t0 + 4tm + tp
te =
6
3.1. Standard Deviation of An activity (σ)
• This is the measurement of uncertainty, which is approximately one sixth of time range
i.e.

tp − t 0
=
6

β -curve with skewness to the left

• It can be seen above that σ is affected by relative distance from the most optimistic
estimate to the most pessimistic estimate.
• Therefore, wide range in lime estimates represents gloater uncertainly.
In a limiting case, certainty of activity duration occurs only when the throe lime estimates
coincide. so that the standard deviation and the variance both vanish. Consequently the
activity duration becomes certain which is the case of CPM. Hence. a PERT is a general
case whereas CPM is the particular case of PERT

10
byjusexamprep.com
3.2. Variance of an Activity (σ2)
• Square of standard deviation is variance of an activity. II is to be noted that higher the
uncertainty about a process, greater Is the standard deviation and hence greater is the
variance of a project
A beta distribution is the ono which is not symmetrical about its apex. Figure below shows
two beta distribution curves, one having skew to the left (Beta distribution for optimistic
estimator) and other having skew to the right (Beta distribution curve for the pessimistic
estimator).

Fig. Two different forms of β – distribution curves

3.3. Central Limit Theorem
The theorem states that a project consists of a large number of activities, each activity
has its own mean time (te), standard deviation (σ). valiance (σ 2) and also its own β-
distribution curve. The distribution of lime for the project as a whole will approximately
be a normal distribution. i.e. mean time or expected time of a Project is
te = te1 + te2 +te3 + …… along critical path and the variance is,

2 = 12 + 22 + 23 + ...... along critical path. Hence standard deviation of the project as a

whole

= 12 + 22 + 32 + ......

along critical path.

3.4. Critical path:
The time wisp longest path is the critical path. In this path, any type of delay in any event
will cause delay in the pm(oct. These are shown by double lines or dark lines m n network.
1.2-3-4 is the critical path of following net work

11
byjusexamprep.com

Time computation of Events: 1. Earliest Expected Occurrence Time (EOT): the limo at
which an event is expected to ow; earliest.
• The time at which on event can be expected to occur earliest.
• M event occurs when all the activities leading toil are completed.
• Ito generally denoted by TE It Is calculated by forward path.

TEj = TEi + tij ……….(when there only one path)

(
TEj = TEi + tij )
max (when Moro are more than one path)

Here.

TEj = EOT of event j T

TEi = EOT of event i

t/ = Expected time of activity I – j

2. Latest Allowable Occurrence Time (LOT): The latest allowable time at which an event
must mar lo keep the project on schedule.
It is generally denoted by TL. This is calculated through backward path.

(
TLi = TLi + tij ) ...(when there is only one path)
(
TLi = TLi + tij )
min ( ...when there are more than ono path)

Where

TLi =B LOT or event j

TLi = LOT of event i

tj= unexpected time of activity I -j

NOTE The latest allowable occurrence time of (ho finish event is equal to the schedule
completion time 00° project.
• Slack
12
byjusexamprep.com
Slack is defined as the difference between latest allowable time (TL) and earliest expected
time (TE) of an event.
i J
Slack for any event j = TL − tE

i i
Slack for any event I = TL − tE .

Slack may be positive or, zero or negative.

When ‘slack is greater than zero”. It indicates project is ahead of scheduled and
availability of excess resources. Such events are sub critical.
If slack is zero, It indicates work is on schedule and events are critical. Resources are
just adequate.
If slack is negative, it indicates work is behind scheduled and may cause delay in project
completion. Events are super critical. Extra resources are required.
The path having minimum or zero slack value is the ‘critical path’ which is also time wise
longest path.
Probability of a project to be completed in scheduled time:
Probability of a project to get complete in expected time(T e) is just 50% and probability
of completion increases or decreases with an increase or decrease of scheduled time
respectively.
As the probability distribution curve for the entire project is normal distribution curve.
Probability can be calculated by using probability factor(Z) which is defined as,

Ts Te
Z

Value of Z Probability (%)

0 50.00

+1 84.13

+2 97.72

+3 99.87

–1 15.87

–2 2.28

–3 0.13

It should be noted that

1. At Z = 0, Te and probability = 50%
Z < 0. Ts < Te probability < 50% and vice versa.
2. For intermediate value of Z, interpolation is required.
3. The time and probability distribution for project as whole is a normal distribution.
13
byjusexamprep.com
4. Area under the curve is equal to unity.
5. 68% of the area lies within ‘te – σ’ and ‘te + σ’ range. This is called probable range.
6. Area bounded by te + 2σ and te – 2σ range is about 95%
7. Area bounded by te - 3σ and te + 3σ is about 99.7% which is approximately equal to
area bounded by to and tp, which is maximum probable range.

tp tp
6

4. CRITICAL PATH METHOD (CPM)

This is based on deterministic approach in which only one time estimate is made for activity

completion. Network diagram in CPM is activity oriented.

● It is activity oriented network

● It is used for repetitive type of work and has deterministic approach.

4.1. Comparison between PERT and CPM

PERT

1. It is event oriented.

2. It has probabilistic approach. The probability distribution is of the type of β distribution

3. Three types of times are estimated on the basic of which an expected time t e is derived.

4. Cost is directly proportional to time. Hence efforts are made to minimize the time so

as to result in the minimum cost.

5. It is suitable for newer type of projects which have not been performed in the past and

no exact assessment of time and cost are available.

14
byjusexamprep.com

Examples: Research work, launching of space a craft, development of misssile

programme etc.

CPM
1. It is an activity oriented network.
2. It has deterministic approach. probability value approaches to one here.
3. Only one time is calculated I.e. activity duration “t”.
4. Time and cost are related by the following curve given from this curve optimum time
is derived which result in the minimum cost.
5. It is suitable for repetitive type of work where time and cost can be evaluated with fair
degree of accuracy.

15
byjusexamprep.com
Examples:
● Construction work,
● Maintenance work,
● Civil engineering projects.
4.2. Event Times in CPM
1. Earliest occurrence time (TE): Time at which an event may occur as early as possible.
2. Latest allowable time (TL): Time at which event may occur as late as possible without
delaying the overall project completion time.
These are similar to PERT and are calculated in the same fashion.
4.3. Activity times in CPM
1. Earliest start time(EST): It is the earliest possible time at which an activity can be
started.
For an activity i–j, earliest event time of event i, i.e. TEi is EST of activity i–j
2. Earliest finish time (EFT): It is the earliest possible time by which an activity can be
completed.
For an activity i–j
EFT = EST +tij = TEi + tij
tij = Activity duration

3. Latest start time(LST): This is the latest possible time at which an activity can be
started without delaying the overall project
∴ LST = LFT - Activity duration
∴ LST= TLi – tij
LFT = latest finish time of activity i – j = TLi
4. Latest finish time (LFT): This is the latest time by which an operation or activity
must be completed without delaying the project.
For an activity i – j, latest allowable time of head event j, i.e. TLj is LFT of activity i–j.
Note: LST of an activity is to be calculated on the basis of latest occurrence time of its
head event and not on the brass of latest occurrence time of its tail event.
Float
● It is associated with activity times
● It is analogous to slack of event in PERT.
● It is the range within which start or finish time of an activity may fluctuate without
affecting the project completion time.
● Floats are of following types:
16
byjusexamprep.com
1. Total float: The time span by which starting or finishing of an activity can be delayed
without delaying the completion of the project.
It is the maximum available time in excess of the activity completion time.
Total float is given by FT
FT = (TLj – TEi) – tij
Total float is given by FT
FT = (TLj ) – (TEj – tij)
FT = (TLj ) – (TEj – tij)
FT = LFT – EFT
FT = (TLj – tij) – TEi
FT = LST – EST

∙ Total float of an activity affects total float of succeeding as well as preceding activities.
2. Free float (FF): The delay which can be made without delaying succeeding activities. It
affects only preceding activities. It is denoted by F F. It is assumed that all activities start
as early as possible.
Free float is given by

FF (TEi TEi ) – tij

⇒ F F = FT – S j
where Sj is head event slack.
In free float, preceding activity is not allowed to occur at its latest time and hence total
float of preceding activity is affected. However the succeeding activity can start at its
earliest start time and hence its total float is not affected.
3. Independent float (FID): It is the minimum excess available time which exists without
affecting any of succeeding or preceding activities. It is denoted by F ID.
● It is the excess of minimum available time over the activity duration.

FID (TEi TLi ) – tij

FID = FF – Si
Where Si is tail event slack.
4. interfering float (FINT): It is similar to head event slack.
FINT = Sj = FT – FF

17
byjusexamprep.com
4.4. Critical Path
In CPM analysis, the path along which total floats are zero or minimum is called as critical
path. All activities on this path are critical. There can be more than one critical paths.
4.4.1. Subcritical Path: It is the path joining all subcritical activities. For a subcritical
activity total float is greater than zero i.e.,
FT > 0
4.4.2. Supercritical Path: It is the path joining all super critical activities. For a
supercritical activity total float is less than zero i.e.,
FT < 0
Example: Compute the earliest expected time of completion of a project whose network
is shown below. The earliest expected time of each activity is shown on arrows (in Weeks).

Solution:
The network commences from event 1 and culminates at event 9.
Thus earliest expected time of completion of event (TE1) = 1
Earliest expected time for event

2(TE2 ) TE1 t12

E 0 5 5 weeks

Similarly earliest expected time for event

3(TE3 ) TE1 t13

E 0 3 3 weeks
Event 4 is approached by paths 1→4 and 1→2→4.
4
For these two paths (TE ) TE1 t14
E 0 3 3 weeks (for path 1 4)

(TE4 ) TE2 t24

E 5 6 11 weeks (for path 1 2 4)

TE4 11 weeks
Thus, (Larger of weeks and 11 weeks)
1
Thus, TE 0

TE2 5 weeks

18
byjusexamprep.com

TE3 3 weeks

TE2 t24 5 6 11 weeks

TE4 E
11 weeks
TE1 t14
E 0 3 3 weeks

TE2 t25
E 5 9 14 weeks

TE3 t36
E 3 7 10 weeks

TE5 t57 14 7 21 weeks

TE7 E
21 weeks
TE3 t 47
E 11 8 19 weeks

TE5 t5E 8
14 16 30 weeks
TE8 TE6 t6–8
E 10 4 14 weeks 30 weeks
TE3 t3–8
E 3 10 13 weeks
Now,

TE7 t7E 9
21 18 39 weeks
TE9 44 weeks
Now; TE8 t8–9
E 30 14 44 weeks

So, earliest expected time of completion of project = 44 weeks

Example: In the network as shown, the three times viz. optimistic time and the
pessimistic time (in days) are shown on the arrows. Compute the earliest expected times
and the latest allowable occurrence times of various events

Solution:
The expected time of an activity is given by,

t0ij 4t Lij t Pij

t ijE
6

19
byjusexamprep.com

Activity i-j tij0 tijL tijP tijE TEj TLj

Successor event j Predecessor event i

10 9 4 7 10 7 37.17 37.17

9 8 2 4 6 4 30.17 30.17

9 7 6 10 12 9.67 30.17 30.17

8 6 5 9 11 8.67 26.17 26.17

8 5 3 5 7 5 26.17 26.17

7 5 0 0 0 0 19 20.5

7 3 11 13 15 13 19 20.5

6 5 0 0 0 0 17.5 17.5

6 2 8 10 14 10.33 17.5 17.5

5 4 4 10 12 9.33 17.5 17.5

4 2 2 4 5 3.83 8.17 8.17

4 1 6 8 11 8.17 8.17 8.17

3 1 4 6 8 6 6 7.5

2 1 1 3 5 3 3 4.34

20
byjusexamprep.com
5. CRASHING OF NETWORK, RESOURCE ALLOCATION AND CPM UPDATING

5.1. Cost Model Analysis

∙ In CPM, time is related to cost and the objects is to develop an optimum time-cost
relationship.
∙ The overall project duration can be reduced by reducing the duration of only the critical
activities in the project network. The durations of such activities may be reduced in two
ways.
(a) By deploying more resources for the early completion of such activities.
(b) By relaxing the technical specifications for such activities.
● In whole of CPM Cost model, we will be assuming that project duration is reduced by
deploying more resources on critical activities.
● In CPM, there are two time and cost estimates for each activity: ‘normal estimate’ and
‘crash estimate’ in the normal estimate, the emphasis is on cost with time being
associated with minimum cost. The ‘crash’ estimate involves the absolute minimum time
required for the job and the cost necessary to achieve it. Here the emphasis is on ‘time’.
5.2. Project Cost
Total project cost is the sum of two separate costs:
(a) The direct cost for accomplishing the work, and
(b) The indirect cost related to the control or direction of that work, financial overhead,
lost production, and the hike etc.
The components of the total cost are shown in figure below.

21
byjusexamprep.com

5.3. Components of Project Cost

5.3.1. Indirect Project Cost
● Indirect costs on a project are the expenditures which cannot be apportioned or clearly
allocated to the individual activities of a project, but are assessed as a whole. The indirect
cost includes the expenditures related to administrative and establishment charges,
overhead, supervision, expenditure on a central store organization, loss of revenue, lost
profit, penalty etc.
● Indirect cost rises with increased duration, considering only overhead and supervision.
It is represented by a straight line, with a slope equal to daily overhead.
● But when there is a loss in profits, due to inability to meet demand or due to some
penalty due to delay, a corresponding cost increase must be added to the cost of
overheads producing the curve. Such a loss is called the outage loss.
● The total indirect cost curve will thus be curved.

5.3.2. Direct Project Cost

● It is cost which is directly dependent on the amount of resources involved for completion
of activities.
● It includes labour materials, plants and machining etc.
● To get the same work done in less time, we have to increase amount of labour,
equipment and time saving materials, plants and machining etc.

22
byjusexamprep.com
● To get the same work done in less time, we have to increase amount of labour,
equipment and time saving material that too extra charges which simply means increases
in direct cost.
● The project has highest cost corresponding to the crash duration, and has normal cost
corresponding to the normal duration.
● Normal time (tn): Normal time is the standard time that an estimator would usually
allow for an activity.

● Crash Time (tc): Crash times is the minimum possible time in which activity can be
completed, by employing extra resources. Crash time is that time, beyond which the
activity cannot be shortened by any amount of increase in the resources.
● Normal Cost (Cn): This is direct cost required to complete the activity in normal time
duration.
● Crash Cost (Cc)): This is direct cost corresponding to the completion of the activity
within crash time.

6. CONVENTIONAL PROBLEMS

Problem 1: Consider the network as shown below with expected time of completion of each
activity (tE in days) is shown on arrows. Calculate the earliest expected time of the network for
the completion of work.

(Ans. 40 days)

23
byjusexamprep.com
Problem 2:
For the network as shown below, determine the critical the critical path. The duration of each
activity (in days) is shown on the arrows.

(Ans. 1-3-5-6-7-8-9)
Problem 3:
A network is shown below with activity times (in days) marked on the arrows. Compute the
various floats.

(Ans. 1-3-4-5-6-7-8)
Problem 4:
Table shown below gives information on a two activities network. The project overhead costs
are Rs. 400 per day. Work out the least cost plant for the network.
Activity Normal duration (days) Normal Cost (Rs.) Crashing duration (days) Crash Cost (Rs.)

1-2 6 7000 4 9000

2-3 10 9000 5 13000

(Ans. Rs. 22,400 for project duration of 16 days)

24
byjusexamprep.com
Problem 5:
Given below is the table showing durations and costs of various activities of the network shown
below:

Normal duration Normal Cost Crashing duration Crash Cost

Activity
(days) (Rs.) (days) (Rs.)

1-2 5 4050 3 9500

2-3 7 3150 4 7520

2-4 9 3750 6 5650

3-4 6 5520 3 10550

The overhead cost of the project is Rs. 1750 per day. Determine the optimum duration of the
project and the corresponding cost.
(Ans. 14 days, Rs. 47016.67)

****

25