it cannot be determined in a graphical solution of an L.P.P.
it is independent of the objective function.
it implies that there must be a convex region satisfying all the constraints.
extreme points of the convex region gives the optimum solution.
Two parallel activities have the same tail and head events.
The chain of activities may have a common event yet he independent by themselves.
Both a & b
None of the above.
AOA diagrams are simple to construct.
AOA diagrams give a better sense of the flow of time throughout a project.
AOA diagrams do not involve dummy activities
ALL the above.
number of origins to equal number of destinations at minimum cost.
number of origins to equal number of destination at maximum cost.
only to maximize cost.
only to maximize the profit.
What acitivities preceede this acitivity.
What acitivities follow this acitivity.
What activity can concurrently take place with this activity.
All the above.
number of rows is greater than number of columns.
number of rows is lesser than number of columns.
number of rows is equal to number of columns.
if the entry of row is zero.
which forms the boundary of feasible region.
which do not optimizes the objective function.
which does not form boundary of feasible region.
which optimizes the objective function.
It is a unimodal distribution that provides information regarding the uncertainty of time estimates of activities.
It has got finite non-negative error.
It need not be symmetrical about model value .
All the above
total supply is not equal to total demand.
total supply is greater than total demand.
total supply is lesser than total demand.
total supply is equal to total demand.