Description : A common assumption about the players in a game is that a. Neither player knows the payoff matrix b. The players have different information about the payoff matrix c. Only one of the players pursues a rational strategy d. The specific identify of the players is irrelevant to the play of the game
Last Answer : d. The specific identify of the players is irrelevant to the play of the game
Description : Every combination of strategies determines an outcome known as _____ a. Regret b. Payoff c. Saddle point d. Profit matrix
Last Answer : b. Payoff
Description : A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is called___ a. Centre point b. Main point c. Saddle point d. Equal point
Last Answer : c. Saddle point
Description : A ______ is the one in which the player selects more than one strategy with fixed probabilities before playing the game. a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy
Last Answer : d. Impure strategy
Description : A _______ provides a complete definition of how a player will play a game a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy
Last Answer : c. Complete strategy
Description : Who developed the Game Theory a. J.R. Hicks b. William J. Baumol c. Neumann Morgenstern d. Samuelson P.T.
Last Answer : c. Neumann Morgenstern
Description : Operations Research emphasizes on the overall approach to the system. This characteristic of Operations Research is often referred as a. System Orientation b. System Approach c. Interdisciplinary Team Approach d. None of the above
Last Answer : c. Interdisciplinary Team Approach
Description : The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player
Last Answer : Player
Description : A strategy that is best regardless of what rival players do is called a. First-mover advantage b. A Nash equilibrium strategy c. Tit-for-tat d. A dominant strategy
Last Answer : d. A dominant strategy
Description : ______ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory
Last Answer : a. CPM
Description : The theory that individuals act depending upon their evaluation of whether their effort will lead to good performance, whether good performance will be followed by a reward, and whether that reward is attractive ... Equity Theory ; (b) Expectancy Theory ; (c) Empirical Theory ; (d) Outcome Theory
Last Answer : (b) Expectancy Theory ;
Description : A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game
Last Answer : c. Play
Description : The various alternatives or courses of actions available to each player in a game are called as ____ a. Saddle points b. Strategies c. Pay-off d. Gains
Last Answer : b. Strategies
Description : In a game, the alternatives or courses of action available to each player are called _____ a. Options b. Choices c. Actions d. strategies
Last Answer : d. strategies
Description : The participants in a game are called ______ a. Clients b. Members c. Customers d. Players
Last Answer : d. Players
Description : . In a zero-sum game, a. What one player wins, the other loses b. The sum of each player’s winnings if the game is played many times must be zero c. The game is fair-each person has an equal chance of winning d. Long-run profits must be zero
Last Answer : a. What one player wins, the other loses
Description : An activity whose start or end cannot be delay without affecting total project completion time is called ______ activity a. Dummy b. Non-critical c. Critical d. Important
Last Answer : c. Critical
Description : Pick up the incorrect statement from the following a. The activity which consumes maximum time, is called a node b. The activity is the time consuming part of a project c. The beginning ... of a job, are called events d. Logically and sequentially connected activities and events form a network
Last Answer : a. The activity which consumes maximum time, is called a node
Description : Dog trainers: What works better? Consequence training, or reward training?
Last Answer : With my dog,alittle of both,but alot more reward based as she is a sensitive dog. I do not think choke collars are cruel.We don’t even use one anymore.She is always off leash and is a good dog:) When are you getting your pup?
Description : What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point
Last Answer : c. Imbalanced growth point
Last Answer : a. Equilibrium point
Description : In project crashing, as we systematically, crash the project, direct cost of project ______ a. Increases b. Decreases c. Remain same d. None of the above
Last Answer : a. Increases
Description : Floats for critical activities will be always _____ a. One b. Zero c. Highest d. Same as duration of the activity
Last Answer : b. Zero
Description : Backward pass calculations are done to find ________ occurrence times of events a. Tentative b. Definite c. Latest d. Earliest
Last Answer : c. Latest
Description : Forward pass calculations are done to find _____ occurrence times of events a. Exact b. Earliest c. Latest d. Approximate
Last Answer : b. Earliest
Description : The second longest path in the network diagram is called a. Alternate b. Feasible c. Sub-critical d. Critical
Last Answer : c. Sub-critical
Description : In a PERT network, the earliest(activity) start time is the a. Earliest time that an activity can be finished without delaying the entire project b. Latest time that an activity can ... of precedence requirements d. Latest time that an activity can be finished without delaying the entire project
Last Answer : c. Earliest time that an activity can be started without violation of precedence requirements
Description : The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.
Last Answer : a. PERT deals with events and CPM with activities
Description : At the completion of the forward and backward passes, the slack for an activity is given by the a. Difference between early start and early finish b. Difference between early start and ... c. Difference between latest start and early finish d. Difference between latest start and latest finish
Last Answer : c. Difference between latest start and early finish
Description : . In what year was PERT developed? a. 1957 b. 1959 c. 1960 d. 1958
Last Answer : . 1957
Description : The CPM was developed by Rand and Walker in which year? a. 1957 b. 1958 c. 1959 d. 1960
Last Answer : a. 1957
Description : What is the benefit of using PERT/CPM network as integral component of project management? a. They furnish a consistent framework for planning, scheduling, monitoring and controlling project b. They illustrate ... that the project will be completed by a specific date d. All of the above
Last Answer : d. All of the above
Description : For a project manager to have an effective means of identifying and communicating the planned activities and their interrelationships, he must use a network technique. One of the network ... evaluation review technique c. Path evaluation review technique d. Project execution review technique
Last Answer : b. Program evaluation review technique
Description : What network model enables engineer managers to schedule, monitor and control large and complex projects by employing three time estimates per activity a. Forecasting b. Program evaluation review technique c. Critical path method d. simulation
Description : What network model enables engineer managers to schedule, monitor and control large and complex projects by using only one time factor per activity a. Forecasting b. Program evaluation review technique c. Critical path method d. simulation
Description : If no. of rows are not equal to number of columns and the matrix elements are profit elements then the problem is: a. Balanced and Maximization Transportation problem b. ... Transportation problem c. Balanced and Maximization Assignment problem d. Unbalanced and Maximization Assignment problem
Last Answer : a. Balanced and Maximization Transportation problem
Description : If no. of rows are equal to number of columns and the matrix elements are Time elements then the problem is: a. Balanced and Minimization Transportation problem b. ... Transportation problem c. Balanced and Minimization Assignment problem d. Unbalanced and Minimization Assignment problem
Last Answer : c. Balanced and Minimization Assignment problem
Description : ___ is one of the fundamental combinatorial optimization problems a. Assignment problem b. Transportation problem c. Optimization problem d. None of the above
Last Answer : a. Assignment problem
Description : For solving an assignment problem, which method is used? a. British b. American c. German d. None of the above
Last Answer : B. american
Description : For maximization in assignment problem, the objective is to maximize the a. Profit b. Optimization c. Cost d. None of the above
Last Answer : a. Profit
Description : An optimal solution of an assignment problem can be obtained only if a. Each row & column has only one zero element b. Each row & columns has at least one zero element c. The data is arrangement in a square matrix d. None of the above
Last Answer : d. None of the above
Description : An assignment problem is a special case of transportation problem, where a. Number of rows equals number of columns b. All rim conditions are 1 c. Values of each decision variable is either 0 or 1
Last Answer : D.variable is either 0 or 1
Description : The assignment problem a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximize resources d. All of the above
Description : If there were n workers & n jobs there would be a. N! solutions b. (n-1)! Solutions c. (n!)n solutions d. N Solutions
Last Answer : a. N! solutions
Description : Maximization assignment problem is transformed into a minimization problem by a. Adding each entry in a column from the maximization value in that column b. Subtracting each entry in a column from the maximum ... entry in a column from the maximum value in that table d. Any one of the above
Last Answer : c. Subtracting each entry in a column from the maximum value in that table
Description : The purpose of a dummy row or column in an assignment problem is to a. Obtain balance between total activities and total resources b. Prevent a solution from becoming degenerate c. Provide a means of representing a dummy problem d. None of the above
Last Answer : a. Obtain balance between total activities and total resources
Description : . The method used for solving an assignment problem is called a. Reduced matrix method b. MODI method c. Hungarian method d. None of the above
Last Answer : . c. Hungarian method
Description : While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to a. Minimize total cost of assignment b. Reduce the cost of ... to zero c. Reduce the cost of that particular assignment to zero d. All of the above
Last Answer : c. Reduce the cost of that particular assignment to zero
Description : An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of a. Rows or columns b. Rows & columns c. Rows + columns -1 d. None of the above
Last Answer : b. Rows & columns
Description : An assignment problem is considered as a particular case of a transportation problem because a. The number of rows equals columns b. All xij = 0 or 1 c. All rim conditions are 1 d. All of the above