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 : _____ 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 : If in a LPP, the solution of a variable can be infinity large without violating the constraints, the solution is ___ a. Infeasible b. Unbounded c. Alternative d. None of the above
Last Answer : b. Unbounded
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 : 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 : . In simplex algorithm, which method is used to deal with the situation where an infeasible starting basic solution is given? a. Slack variable b. Simplex method c. Big M Method d. None of the above
Last Answer : b. Simplex method
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 : 63. Graphic method can be applied to solve a LPP when there are only ____ variable a. Four b. More than one c. Two d. three
Last Answer : Which oil is used in the floatation method for the purification of ores?
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 : 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 : 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 : Which variables are fictitious and cannot have any physical meaning? a. Optimal variable b. Decision variable c. Artificial variable d. None of the above
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
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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 : ______ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory
Last Answer : a. CPM
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 : 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 : 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 : 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 : BFS in LPP stands for: a. Best Feasible solution b. Better feasible solution c. Basic feasible solution d. None of the above
Last Answer : c. Basic feasible solution
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 : 64. If the feasible region of a LPP is empty, the solution is _______ a. Infeasible b. Unbounded c. Alternative d. None of the above
Last Answer : a. Infeasible
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 : 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 : 57. The solution space(region) of an LP problem is unbounded due to a. An incorrect formulation of the LP model b. Objective function is unbounded c. Neither a nor b d. Both a & b
Last Answer : b. Objective function is unbounded c. Neither a nor b
Description : 55. If two constraints do not intersect in the positive quadrant of the graph, then a. The problem is infeasible b. The solution is unbounded c. One of the constraints is redundant d. None of the above
Last Answer : a. The problem is infeasible
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