CBOT

1. 1.The linear function which is to be minimized or maximized is called ....

• a) Constraints

• b)convex function

• c ) objective function

• d) concave function

2.In LPP if the solution is obtained by graphical method, the number of

variables is restricted to …….

• (a) Odd number

• (b) Any number

• (c) Only three

• (d) Only two

3.In the unbalanced TP, the dummy row or column introduced at a unit

transportation cost of ...

• (a) zero

• (b) one

• (c) M

• (d) -M

4.In a (m x n) TP model, for the degeneracy of the basic solution, the number

of basic cells must be ...

• (a) m + n

• (b) < m + n – 1

• (c) > m + n – 1

• (d) = m + n - 1

5.The assignment problem can be solved by ……… method

• (a) Hungarian method

• (b) Modi method

• (c) Vogel’s method

• (d) Least cost method

6.---------- is the point of intersection of pure strategies.

• (a)maximum point

• (b)minimum point

• (c)critical point

• (d)saddle point

7.M/M/I model is known as ...

• (a) Poisson model

• (b) Birth death model

• (c) Exponential model

• (d) Multi server model

8.--------- is a physically identifiable art of project which consumes time and

resources.

• (a)Event

• (b )Activity

• (c) Node

• (d) Network

9.The time taken to complete the total task along the critical path is ...

• (a) critical length

• (b) optimistic time

• (c) pessimistic time

• (d) most likely time

10. 10.Queueing Model represented by using ...notation

• a) Kendal's notation

• b ) Ken's notation

• c ) lagrange's notation

• d ) None