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 : 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 : A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game
Last Answer : c. Play
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 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 : 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 : 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 : A BFS of a LPP is said to be ______ if at least one of the basic variable is zero a. Degenerate b. Non-degenerate c. Infeasible d. unbounded
Last Answer : a. Degenerate
Description : In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ______ should be selected a. Slack variable b. Surplus variable c. Decision variable d. None of the above
Last Answer : c. Decision variable
Description : 44. The word “Programming” means taking decisions ______ a. Systematically b. Rapidly c. Slowly d. Instantly
Last Answer : a. Systematically
Description : 16. Operations Research simply helps in improving the ______ of the solution but does not result in a perfect solution a. Quality b. Clarity c. Look d. None of the above
Last Answer : a. Quality
Description : 10. There is a great scope for ______ working as a team to solve problems of defence by using the Operations Research approach a. Economists b. Administrators c. Statisticians and Technicians d. All of the Above
Last Answer : d. All of the Above
Description : In a chess tournament, where participants were to play one game with one another, two players fell ill, having played 6 games each without playing -Maths 9th
Last Answer : answer:
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 : 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 : 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 : In game theory, the outcome or consequence of a strategy is referred to as the a. Payoff b. Penalty c. Reward d. End-game strategy
Last Answer : a. Payoff
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 : 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 : 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 : . 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 : When a particular assignment in the given problem is not possible or restricted as a condition, it is called a __ problem a. Infeasible b. Degenerate c. Unbalanced d. Prohibited
Last Answer : d. Prohibited
Description : The extra row or column which is added to balance an assignment problem is called _____ a. Regret b. Epsilon c. Dummy d. extra
Last Answer : c. Dummy
Description : A basic solution which also satisfies the condition in which all basic variables are non-negative is called ___ a. Basic feasible solution b. Feasible solution c. Optimal solution d. None of the above
Last Answer : a. Basic feasible solution
Description : 65. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called as _______ a. Optimal solution b. Non-basic variables c. Solution d. Basic Feasible solution
Last Answer : a. Optimal solution
Description : 58. While solving a LP model graphically, the area bounded by the constraints is called a. Feasible region b. Infeasible region c. Unbounded solution d. None of the above
Last Answer : a. Feasible region
Description : 56. Constraints in LP problem are called active if they a. Represent optimal solutions b. At optimality do not consume all the available resources c. Both a & b d. None of the above
Last Answer : a. Represent optimal solutions
Description : 25. Operations Research models in which some or all values of variables are random in nature are called _____ a. Physical b. Symbolic c. Deterministic d. Probabilistic
Last Answer : d. Probabilistic
Description : Operations Research models in which values of all variables and all possible outcomes are known with certainty are called _____ a. Physical b. Symbolic c. Deterministic d. Probabilistic
Last Answer : c. Deterministic
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 : The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player
Last Answer : Player
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 : 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 : 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