In a maximum flow problem, the source and sink have fixed supplies and demands.

Select one:

True

False

Unimodularity property in transportation problem helps to reduce the cost of transportation

Select one:

True

False

An assignment problem with n projects and n teams will have n+n constraints and n+n decision variables

Select one:

True

False

A Transshipment problem with n transshipment nodes will have n^2 (n square) constraints corresponding to transshipment nodes

Select one:

True

False

Critical time in CPM indicates the maximum possible minimum time to complete the project

Select one:

True

False

The number of constraints in a minimum cost flow problem is equal to the number of arcs present

Select one:

True

False

Transhipment node in network flow problems satisfies the law of conservation of flow

Select one:

True

False

Maximal flow problem in general aims to reduce the cost of shipping products from supply region to demand region

Select one:

True

False

A spanning tree with n nodes will have n-1 arcs in its minimum spanning tree

Select one:

True

False

For an 8 city travelling salesman problem, we have to add up to 4 city sub-tour elimination constraints

Select one:

True

False