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 : 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 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 : 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 : If the number of jobs is not equal to the number of resources, then the problem is term as _____ assignment problem a. Balanced b. Unbalanced c. Equal d. Unequal
Last Answer : b. Unbalanced
Description : If the number of jobs is equal to the number of resources, then the problem is term as _____ assignment problem a. Balanced b. Unbalanced c. Equal d. Unequal
Last Answer : a. Balanced
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 : . 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 : ______ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory
Last Answer : a. CPM
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 : 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 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
Last Answer : 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 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
Description : If in an assignment problem, number of rows is not equal to number of columns then a. Maximization problem b. Problem is unbalanced c. Problem is degenerate d. Optimum solution is not possible
Last Answer : c. Problem is degenerate
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 : 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 : ________ technique is related to Quality control a. Assignment b. Transportation c. CPM d. SQC
Last Answer : d. SQC
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 : 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 : 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 : Forward pass calculations are done to find _____ occurrence times of events a. Exact b. Earliest c. Latest d. Approximate
Last Answer : b. Earliest
Description : An optimum solution is considered the _____ among feasible solutions a. Worst b. Best c. Ineffective d. None of the above
Last Answer : b. Best
Description : _____ refers to the combination of one or more inputs to produce a particular output a. Solution b. Variable c. Process d. None of the above
Last Answer : c. Process
Description : _____ is another method to solve a given LPP involving some artificial variable? a. Big M method b. Method of penalties c. Two-phase simplex method d. None of the above
Last Answer : a. Big M method
Description : The word “Linear” means that the relationships are represented by _____ a. Diagonal lines b. Curved lines c. Straight lines d. Slanting lines
Last Answer : c. Straight lines
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 : Operations Research techniques cannot be applied to _____ a. Managerial judgement b. Business initiatives c. Customer perceptions d. All of the above
Last Answer : c. Customer perceptions
Description : _____ technique is related to Inventory management a. EOQ b. SQC c. CPM d. transportation
Last Answer : a. EOQ
Description : 13. Operations Research cannot give perfect _____ to problems a. Answers b. Solutions c. Both a & b d. Decisions
Last Answer : c. Both a & b
Description : 9. Operations Research has the characteristics that it is done by a team of _____ a. Scientists b. Mathematicians c. Academics d. All of the above
Last Answer : a. Scientists
Description : 5. Operations Research was known as an ability to win a war without really going into a _____ a. Battle Field b. Fighting c. War d. Both a & b
Last Answer : d. Both a & b
Description : The Term Operations Research was coined in the year _____ a. 1950 b. 1940 c. 1978 d. 1960
Last Answer : B. 1940
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 : 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 : 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 : 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 : ________ which is a subclass of a linear programming problem(LPP) a. Programming problem b. Transportation problem c. Computer problem d. All of the above
Last Answer : b. Transportation problem
Description : 62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above
Last Answer : b. Feasible region should have a line segment
Description : 61. If a non-redundant constraint is removed from an LP problem then a. Feasible region will become larger b. Feasible region will become smaller c. Solution will become infeasible d. None of the above
Last Answer : a. Feasible region will become larger
Description : 60. While solving a LP problem, infeasibility may be removed by a. Adding another constraint b. Adding another variable c. Removing a constraint d. Removing a variable
Last Answer : c. Removing a constraint