Description : Activities that cannot be started until one or more of the other activities are completed, are called.......................................... a. Dummy activities b. Initial activities c. Successor activities d. Predecessor activities
Description : Activities lying on critical path are called ............................ a. Critical activities b. Non-critical activities c. Dummy activities d. None of these
Answer : a. Critical activities
Description : An event which represents the beginning of more than one activity is a : a. Merge event b. Net event c. Burst event d. None of these
Answer : c. Burst event
Description : ......................... is a series of activities related to a project. a. Network b. Transportation Model c. Assignment model d. None of these
Answer : a. Network
Description : An activity which does not consume either resource or time is called ............................. a. Predecessor activity b. Successor activity c. Dummy activity d. Terminal activity
Answer : c. Dummy activity
Description : ................... is an event oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive
Answer : b. PERT
Description : ......................... is activity oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive
Answer : a. CPM
Description : In network diagram, events are commonly represented by ......................... a. Arrows b. Nodes c. Triangles d. None of these
Answer : b. Nodes
Description : An activity which must be completed before commencement of one or more other activities is called................................. a. Successor activity b. Predecessor activity c. Dummy activity d. None of these
Answer : b. Predecessor activity
Description : PERT stand for: a. Performance Evaluation Review Technique b. Programme Evaluation Review Technique c. Programme Evaluation Research Technique
Answer : b. Programme Evaluation Review Technique
Description : Non-negativity constraints are written as ...................... a. Equality b. Non-equality c. Greater than or equal to d. Less than or equal to
Answer : c. Greater than or equal to
Description : Straight lines shown in a linear programming graph indicates ........................... a. Objective function b. Constraints c. Points d. All of the above
Answer : b. Constraints
Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet
Answer : d. Spread Sheet
Description : Operations Research Techniques involves ..................... approach. a. Team approach b. Critical approach c. Individual approach d. None of these
Answer : c. Individual approach
Description : Operations Research techniques help to find ................... solution. a. Feasible solution b. Infeasible solution c. Optimal solution d. None of these
Answer : c. Optimal solution
Description : ........................ model is a map which indicates roads, highways, towns and inter- relationships a. Iconic model b. Analogue model c. Mathematical model d. None of these
Answer : b. Analogue model
Description : An organisation chart is an example of ........................... a. Iconic model b. Mathematical model c. Analogue model d. None of these
Answer : c. Analogue model
Description : ....................... is an important Operations Research Technique to analyse the queuing behaviour. a. Game theory b. Waiting line theory c. Decision theory d. Simulation
Answer : b. Waiting line theory
Description : For a minimisation Transportation Problem, the objective is to minimise: a. Profit b. Cost c. Solution d. None of these
Answer : b. Cost
Description : A Transportation Problem is said to be unbalanced when total supply is not equal to ............ a. Total cost b. Total demand c. Both a and b d. None of these
Answer : b. Total demand