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 : _____ 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 : 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 : 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 : Currently, LPP is used in solving a wide range of practical ___________ a. Business problems b. Agricultural problems c. Manufacturing problems d. None of the above
Last Answer : a. Business problems
Description : LPP is exactly used in solving what kind of resource allocation problems? a. Production planning and scheduling b. Transportation c. Sales and advertising d. All of the above
Last Answer : d. All of the above
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 : Every LPP is associated with another LPP is called_____ a. Primal b. Dual c. Non-linear programming d. None of the above
Last Answer : b. Dual
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 : 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 : ________ 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 : 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 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 : How many methods are there to solve LPP? a. Three b. Two c. Four d. None of the above
Last Answer : b. Two
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 : 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 : . 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 : 7. Who defined Operations Research as scientific approach to problem solving for executive management? a. E.L. Arnoff b. P.M.S. Blackett c. H.M. Wagner d. None of the above
Last Answer : c. H.M. Wagner
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 : 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 : 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 : 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 : Gauss-Seidel iterative method can be used for solving a set of?
Last Answer : Gauss-Seidel iterative method can be used for solving a set of linear algebraic equation only.
Description : In simplex method, ........................ should be selected when there is tie between slack/surplus variable and decision variable. a. Slack variable b. Decision variable c. Surplus variable d. None of these
Last Answer : b. Decision variable
Description : In simplex method, we add .......................... in the case of constraints with sign “=” a. Surplus variable b. Artificial variable c. Slack variable d. None of these
Last Answer : b. Artificial variable
Description : A 10-bus power system consists of four generator buses indexed as G1, G2, G3, G4 and six load buses indexed as L2, L2, L3, L4, L5, L6. The generator-bus G1 is connected ... of non linear equations required for solving the load flow problem using Newton-Raphson method in popular form is________.
Last Answer : 14
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 : 6. Who defined Operations Research as scientific method of providing executive departments with a quantitative basis for decisions regarding the operations under their control? a. Morse and Kimball (1946) b. P.M.S Blackett (1948) c. E.L. Arnoff and M.J. Netzorg d. None of the above
Last Answer : a. Morse and Kimball (1946)
Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above
Last Answer : a. Hungarian Method
Description : While solving an LPP, infeasibility may be removed by: a. Removing a variable b. Removing a constraint c. Adding a variable d. Adding a constraint
Last Answer : b. Removing a constraint
Description : While solving a LPP graphically, the area bounded by constraints is called ................. a. Feasible region b. Infeasible region c. Unbounded region d. None of these
Description : Which search algorithm imposes a fixed depth limit on nodes? a) Depth-limited search b) Depth-first search c) Iterative deepening search d) Bidirectional search
Last Answer : a) Depth-limited search
Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm
Last Answer : (C) Greedy best first search algorithm
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
Last Answer : b. Program evaluation review technique
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 : 48. The graphical method of LP problem uses a. Objective function equation b. Constraint equations c. Linear equations d. All of the above
Description : 47. The method of formal calculations often termed as Linear Programming was developed later in which year? a. 1947 b. 1988 c. 1957 d. 1944
Last Answer : a. 1947
Description : Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard
Last Answer : b) NP complete
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 : 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 : 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 : 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 : 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 : 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