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 : 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 : 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 _______ 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 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 : The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player
Last Answer : Player
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 : 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 : The participants in a game are called ______ a. Clients b. Members c. Customers d. Players
Last Answer : d. Players
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 : 33. Before formulating a formal L P model it is better to a. Express each constrain in words b. Express the objective function in words c. Verbally identify decision variables d. All of the above
Last Answer : d. All of the above
Description : . For __________ minimization, we take least value from each column and subtract it from all values of that column. a. Column b. Row c. Profit d. Cost
Last Answer : a. Column
Description : For __________ minimization, we take least value from each row and subtract it from all values of that row. a. Column b. Row c. Profit d. Cost
Last Answer : b. Row
Description : An assumption that implies that finite numbers of choices are available to a decision-maker and the decision variables do not assume negative values is known as _______ a. Certainty b. Continuity c. Finite choices d. None of the above
Last Answer : c. Finite choices
Description : Which variables are fictitious and cannot have any physical meaning? a. Optimal variable b. Decision variable c. Artificial variable d. None of the above
Last Answer : c. Artificial variable
Description : 45. LP is a major innovations since _______ in the field of business decision-making, particularly under conditions of certainty a. Industrial Revolution b. World War I c. World War II d. French Revolution
Last Answer : c. World War II
Description : 40. Which of the following is a limitation associated with an LP model a. The relationship among decision variables is linear b. No guarantee to get integer valued solutions c. No considerations of effect of time & uncertainty on LP model d. All of the above
Description : 35. Which of the following is not a characteristic of the L P model a. Alternative courses of actions b. An objective function of maximization type c. Limited amount of resources d. Non-negativity condition on the value of decision variable
Last Answer : b. An objective function of maximization type
Description : 2. Non-Negativity condition is an important component of L P model because a. Variables value should remain under the control of the decision-maker b. Value of variables make sense & correspond to real-world problems c. Variables are interrelated in terms of limited resources d. None of the above
Last Answer : b. Value of variables make sense & correspond to real-world problems
Description : 30. The distinguishing feature of an LP model is a. Relationship among all variables is linear b. It has single objective function & constraints c. Value of decision variables is non-negative d. All of the above
Last Answer : a. Relationship among all variables is linear
Description : 29. A constraint in an LP model restricts a. Value of objective function b. Value of a decision variable c. Use of the available resources d. All of the above
Description : 27. The mathematical model of an LP problem is important because a. It helps in converting the verbal description & numerical data into mathematical expression b. Decision-makers prefer to ... captures the relevant relationship among decision factors d. It enables the use of algebraic technique
Last Answer : a. It helps in converting the verbal description & numerical data into mathematical expression
Description : ______ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory
Last Answer : a. CPM
Description : Operations Research, which is a very powerful tool for _____ a. Research b. Decision-Making c. Operations d. None of the above
Last Answer : Decision-Making
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 : 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 : If profit, sales, production, etc is given then it is _________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem
Last Answer : c. Maximization problem
Description : Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix
Last Answer : c. Regret matrix
Description : An objective function is maximized when it is a _______ function a. Passive b. Profit c. Cost d. None of the above
Last Answer : b. Profit
Description : 52. If an iso-profit yielding the optimal solution coincides with a constraint line, then a. The solution is unbounded b. The solution is infeasible c. The constraint which coincides is redundant d. None of the above
Last Answer : d. None of the above
Description : 51. An iso-profit line represents a. An infinite number of solutions all of which yield the same profit b. An infinite number of solutions all of which incurs the same cost c. An infinite number of optimal solutions d. A boundary of the feasible region
Last Answer : . An infinite number of solutions all of which yield the same profit
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 : 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 : 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 : 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 : 50. Which of the following statements is true with respect to the optimal solution of an LP problem? a. Every LP problem has an optimal solution b. Optimal solution of an LP problem always occurs ... completely used d. If an optimal solution exists, there will always be at least one at a corner
Last Answer : d. If an optimal solution exists, there will always be at least one at a corner
Description : 34. Maximization of objective function in an L P model means a. Value occurs at allowable set of decisions b. Highest value is chosen among allowable decisions c. Neither of above d. Both a & b
Last Answer : a. Value occurs at allowable set of decision
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 : 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
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 : 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 : All the constraints are expressed as equations and the right hand side of each constraint and all variables are non-negative is called_______ a. Canonical variable b. Canonical form c. Canonical solution d. Both a & b
Last Answer : b. Canonical form
Description : 54. A constraint in an LP model becomes redundant because a. Two iso-profits may be parallel to each other b. The solution is unbounded c. This constraint is not satisfied by the solution values d. None of the above
Description : 8. Who defined Operations Research as an aid for the executive in marketing his decisions by providing him with the quantitative information based on the scientific method of analysis? a. C. Kitte b. H.M. Wagner c. E.L. Arnoff d. None of the above
Last Answer : a. C. Kitte
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