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 : 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 : 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 : 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 : 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 : 37. Which of the following is not a characteristics of the LP a. Resources must be limited b. Only one objective function c. Parameters value remains constant during the planning period d. The problem must be of minimization type
Last Answer : d. The problem must be of minimization type
Description : If cost, time, etc is given, then it is ________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem
Last Answer : d. Minimization 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 : 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 : 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 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 : 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 : 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 : A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game
Last Answer : c. Play
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 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 : 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 : The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table ... value in that column. (D) adding maximum value of the table to each entry in the table.
Last Answer : (B) subtracting each entry in the table from the maximum value in that table.
Description : A set of values X1,X2……..Xn which satisfies the constraints of the LPP is called_______ a. Solution b. Variable c. Linearity d. None of the above
Last Answer : a. Solution
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 : 42. _____ assumption means the prior knowledge of all the coefficients in the objective function , the coefficients of the constraints and the resource values a. Proportionality b. Certainty c. Finite choices d. Continuity
Last Answer : b. Certainty
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 : 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 : 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
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 : 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 : 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 : 46. Linear programming has been successfully applied in __________ a. Agricultural b. Industrial applications c. Both a & b d. manufacturing
Last Answer : c. Both a & b
Description : 49. A feasible solution to an LP problem a. Must satisfy all of the problem’s constraints simultaneously b. Need not satisfy all of the constraints, only some of them c. Must be a corner point of the feasible solution d. Must optimize the value of the objective function
Last Answer : a. Must satisfy all of the problem’s constraints simultaneously
Description : . Non-negativity condition in an LP model implies a. A positive coefficient of variables in objective function b. A positive coefficient of variables in any constraint c. Non-negative value of resources d. None of the above
Last Answer : d. None 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 : 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 : 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
Last Answer : d. All of the above
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 : . 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 : 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 : 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 : 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
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 : In simplex method, we add _______ variables in the case of “=” a. Slack variable b. Surplus variable c. Artificial variable d. None of the above
Last Answer : c. Artificial variable
Description : To figure the Net Profit: A. Add up the ticket sales from selling day. B. Add up the ticket sales from selling day and subtract the cost of the ingredients. C. Add up cost to produc3 the product and subtract the total sales. D. Add the cost to produce the product and add the total sales.
Last Answer : A. Add up the ticket sales from selling day.
Description : To figure the Gross Profit: A. Add up the ticket sales from selling day. B. Add up the ticket sales from selling day and subtract the cost of the ingredients. C. Add up cost to produce the product and subtract the total sales. D. Add the cost to produce the product and add the total sales.
Last Answer : B. Add up the ticket sales from selling day and subtract the cost of the ingredients.
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 ______ 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