......................... is a series of activities related to a project. a. Network b. Transportation Model c. Assignment model d. None of these

......................... is a series of activities related to a project.
a. Network
b. Transportation Model
c. Assignment model
d. None of these
by

1 Answer

Answer :

a. Network
by

Related questions

The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b

Description : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b

Last Answer : b. A travelling salesman problem

The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above

Description : The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above

Last Answer : d. All the above

An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these

Description : An assignment problem can be solved by ......................... a. Simplex method b. Transportation method c. Both a and b d. None of these

Last Answer : c. Both a and b

............................ is the sequence of activities which determines the total project duration. a. Critical path b. Network c. Non-critical activities d. None of these

Description : ............................ is the sequence of activities which determines the total project duration. a. Critical path b. Network c. Non-critical activities d. None of these

Last Answer : a. Critical path

Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Last Answer : d. F L Hitchcock

.................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Last Answer : a. Hungarian Method

Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Last Answer : d. All of the above

........................... method is used to solve an assignment problem. a. American method b. Hungarian method c. German method d. British method

Description : ........................... method is used to solve an assignment problem. a. American method b. Hungarian method c. German method d. British method

Last Answer : b. Hungarian method

In a maximisation assignment problem, the objective is to maximise ............................. a. Profit b. Cost c. Optimisation d. None of these

Description : In a maximisation assignment problem, the objective is to maximise ............................. a. Profit b. Cost c. Optimisation d. None of these

Last Answer : a. Profit

The method used for solving an assignment problem is: a. Reduced matrix method b. MODI method c. Hungarian method d. None of these

Description : The method used for solving an assignment problem is: a. Reduced matrix method b. MODI method c. Hungarian method d. None of these

Last Answer : c. Hungarian method

......................... is a scheme or design of something intended to do. a. Network b. Float c. Project d. Program

Description : ......................... is a scheme or design of something intended to do. a. Network b. Float c. Project d. Program

Last Answer : a. Network

In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these

Description : In Transportation Problem, LCM stands for ............................. a. Lowest Common Multiplier b. Least Cost Method c. Lowest Cell Method d. None of these

Last Answer : b. Least Cost Method

In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these

Description : In Transportation Problem, NWCM stands for ............................. a. North West Cost Method b. Net Worth Corner Method c. North West Corner Method d. None of these

Last Answer : c. North West Corner Method

Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

For a minimisation Transportation Problem, the objective is to minimise: a. Profit b. Cost c. Solution d. None of these

Description : For a minimisation Transportation Problem, the objective is to minimise: a. Profit b. Cost c. Solution d. None of these

Last Answer : b. Cost

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

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

Last Answer : b. Total demand

Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these

Description : Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these

Last Answer : a. VAM

In transportation Problems, VAM stands for ......................... a. Value Addition Method b. Vogel’s Approximation Method c. Virgenean Approximation Method d. None of these

Description : In transportation Problems, VAM stands for ......................... a. Value Addition Method b. Vogel’s Approximation Method c. Virgenean Approximation Method d. None of these

Last Answer : b. Vogel’s Approximation Method

The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these

Description : The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these

Last Answer : a. Occupied cells

The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1

Description : The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1

Last Answer : c. m +n – 1

The dummy source/destination in a transportation problem is added to ........................ a. Satisfy rim constraints b. Prevent solution from becoming degenerate c. Ensure total cost does not exceed a limit d. None of the above

Description : The dummy source/destination in a transportation problem is added to ........................ a. Satisfy rim constraints b. Prevent solution from becoming degenerate c. Ensure total cost does not exceed a limit d. None of the above

Last Answer : a. Satisfy rim constraints

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 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

Last Answer : c. Successor activities

Activities lying on critical path are called ............................ a. Critical activities b. Non-critical activities c. Dummy activities d. None of these

Description : Activities lying on critical path are called ............................ a. Critical activities b. Non-critical activities c. Dummy activities d. None of these

Last Answer : a. Critical activities

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

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

Last Answer : b. Predecessor activity

........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. a. Goal programming b. Linear programming c. Decision making d. None of these

Description : ........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. a. Goal programming b. Linear programming c. Decision making d. None of these

Last Answer : b. Linear programming

............................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised. a. Sequencing b. Allocation c. Queuing theory d. Decision theory

Description : ............................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised. a. Sequencing b. Allocation c. Queuing theory d. Decision theory

Last Answer : b. Allocation

A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet

Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet

Last Answer : d. Spread Sheet

........................ 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

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

Last Answer : b. Analogue model

An organisation chart is an example of ........................... a. Iconic model b. Mathematical model c. Analogue model d. None of these

Description : An organisation chart is an example of ........................... a. Iconic model b. Mathematical model c. Analogue model d. None of these

Last Answer : c. Analogue model

Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these

Description : Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these

Last Answer : d. None of the these

Before formulating a formal L P model, it is better to: a. Verbally identify decision variables b. Express the objective function in words c. Express each constraint in words d. All of the above

Description : Before formulating a formal L P model, it is better to: a. Verbally identify decision variables b. Express the objective function in words c. Express each constraint in words d. All of the above

Last Answer : d. All of the above

A constraint in a Linear Programming Model restricts: a. Value of objective function b. Value of decision variable c. Use of available resources d. All of the above

Description : A constraint in a Linear Programming Model restricts: a. Value of objective function b. Value of decision variable c. Use of available resources d. All of the above

Last Answer : d. All of the above

............................... is used to imitate an operation prior to actual performance. a. Inventory control b. Simulation c. Game theory d. Integrated Production Model

Description : ............................... is used to imitate an operation prior to actual performance. a. Inventory control b. Simulation c. Game theory d. Integrated Production Model

Last Answer : b. Simulation

All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these

Description : All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these

Last Answer : b. Constraints

A model is a ........................... a. An essence of reality b. An approximation c. An idealisation d. All of the above

Description : A model is a ........................... a. An essence of reality b. An approximation c. An idealisation d. All of the above

Last Answer : d. All of the above

.......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these

Description : .......................... is the duration by which an activity can be delayed without delaying the project. a. Slack b. Total float c. Both a and b d. None of these

Last Answer : b. Total float

........................... is the latest time by which an activity can be finished without delaying the completion of the project. a. LST b. LFT c. EFT d. EST

Description : ........................... is the latest time by which an activity can be finished without delaying the completion of the project. a. LST b. LFT c. EFT d. EST

Last Answer : b. LFT

..................... is the duration by which an activity can be delayed without delaying the completion of the project. a. Earliest Start Time b. Earliest Finish Time c. Latest Start Time d. Latest Finish Time

Description : ..................... is the duration by which an activity can be delayed without delaying the completion of the project. a. Earliest Start Time b. Earliest Finish Time c. Latest Start Time d. Latest Finish Time

Last Answer : c. Latest Start Time

Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these

Description : Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these

Last Answer : b. Dual

In a network diagram, activity is denoted by ............................ a. Node b. Arrow c. Triangle d. None of these

Description : In a network diagram, activity is denoted by ............................ a. Node b. Arrow c. Triangle d. None of these

Last Answer : b. Arrow

................... is an event oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive

Description : ................... is an event oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive

Last Answer : b. PERT

......................... is activity oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive

Description : ......................... is activity oriented network diagram. a. CPM b. PERT c. Histogram d. Ogive

Last Answer : a. CPM

In network diagram, events are commonly represented by ......................... a. Arrows b. Nodes c. Triangles d. None of these

Description : In network diagram, events are commonly represented by ......................... a. Arrows b. Nodes c. Triangles d. None of these

Last Answer : b. Nodes

....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis

Description : ....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis

Last Answer : d. Network analysis

......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these

Description : ......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these

Last Answer : c. Decision theory

An approach to location anal on analysis that include includes both qualitative and quantitative considerations is a. locational cost-volume b. factor rating c. transportation model d. assignment assignment method e. make or buy analysis

Description : An approach to location anal on analysis that include includes both qualitative and quantitative considerations is a. locational cost-volume b. factor rating c. transportation model d. assignment assignment method e. make or buy analysis

Last Answer : b. factor rating

_____ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory

Description : ______ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory

Last Answer : a. CPM

________ technique is related to Quality control a. Assignment b. Transportation c. CPM d. SQC

Description : ________ technique is related to Quality control a. Assignment b. Transportation c. CPM d. SQC

Last Answer : d. SQC

Which of the following met Which of the following methods best considers intan hods best considers intangible costs related to a l gible costs related to a location decision? ocation decision? a)Weighted method b)Location break-even analysis c)Transportation method d)Assignment method e) None of the above

Description : Which of the following met Which of the following methods best considers intan hods best considers intangible costs related to a l gible costs related to a location decision? ocation decision? a) ... b)Location break-even analysis c)Transportation method d)Assignment method e) None of the above

Last Answer : b)Location break-even analysis

Which of the following following methods methods best considers considers intangible intangible costs related related to a location location decision? a. crossover crossover methods methods b. locational break-even locational break-even analysis analysis c. factor rating analysis d. the transportation transportation method e. the assignment assignment method

Description : Which of the following following methods methods best considers considers intangible intangible costs related related to a location location decision? a. crossover crossover methods methods b. ... rating analysis d. the transportation transportation method e. the assignment assignment method

Last Answer : d. the transportation transportation method