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 : In an LPP, if the solution of a variable can be made infinitely large without violating the constraints, then the solution is .............................. a. Infeasible b. Alternative c. Unbounded d. Unique
Last Answer : c. Unbounded
Description : If the feasible region of a linear programming problem is empty, the solution is .................... a. Unbounded b. Infeasible c. Infeasible d. Alternative
Last Answer : b. Infeasible
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 : When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be .............................. a. Infeasible b. Unbounded c. Degenerate d. Non-degenerate
Last Answer : c. Degenerate
Description : A LPP model doesnot contain: a. Decision b. Constraints c. Feasible solution d. Spread Sheet
Last Answer : d. Spread Sheet
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 : If there are more than one optimal solutions for the decision variables, the solution is ........... a. Infeasible b. Unbounded c. Alternative d. None of these
Last Answer : c. Alternative
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 : Operations Research techniques help to find ................... solution. a. Feasible solution b. Infeasible solution c. Optimal solution d. None of these
Last Answer : c. Optimal solution
Description : Constraints in an LPP are treated as active, if they: a. Do not consume all the available resources at optimality b. Represent optimal solution c. Both a and b d. None of these
Last Answer : b. Represent optimal solution
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 : A basic feasible solution of a linear programming problem 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 : 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 : If the primal Linear Programming problem has unbounded solution, then it’s dual problem will have (A) feasible solution (B) alternative solution (C) no feasible solution at all (D) no bounded solution at all
Last Answer : (C) no feasible solution at all
Description : The graphical method if LPP uses: a. Linear equations b. Constraint equations c. Objective function d. All of the above
Last Answer : d. All of the above
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 : 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 : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these
Last Answer : b. u. v. Method
Description : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these
Last Answer : c. VAM
Description : Which of the following is a characteristic of a dual problem: a. Dual of a dual is primal b. If dual has a finite optimal solution, then the primal also has finite optimal solution c. If dual has no feasible solution, then the primal also has no feasible solution d. All of the above
Description : Initial feasible solution to a transportation problem arrived through which of the following method is very near to the optimal solution: a. NWCM b. LCM c. VAM d. None of these
Description : Initial feasible solution to a transportation Problem can be found out by ......................... a. VAM b. MODI Method c. Both a and b d. None of these
Last Answer : a. VAM
Description : An optimal solution is considered as the ................... among the feasible solutions. a. Worst b. Best c. Ineffective d. None of these
Last Answer : b. Best
Description : The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are: a. m + n b. m x n c. m +n – 1 d. m +n + 1
Last Answer : c. m +n – 1
Description : Non-negativity constraints are written as ...................... a. Equality b. Non-equality c. Greater than or equal to d. Less than or equal to
Last Answer : c. Greater than or equal to
Description : Straight lines shown in a linear programming graph indicates ........................... a. Objective function b. Constraints c. Points d. All of the above
Last Answer : b. Constraints
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 minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ........................... a. Constraints b. Objectives c. Both a and b d. None of these
Last Answer : b. Objectives
Description : All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these
Description : The dummy source/destination in a transportation problem is added to ........................ a. Satisfy rim constraints b. Prevent solution from becoming degenerate c. Ensure total cost does not exceed a limit d. None of the above
Last Answer : a. Satisfy rim constraints
Description : ..................... are expressed in the form of equations a. Objectives b. Constraints c. Both a and b d. None of these
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 : The Hungarian method for solving an assignment problem can also be used to solve: a. A transportation problem b. A travelling salesman problem c. A linear programming problem d. Both a and b
Last Answer : b. A travelling salesman problem
Description : The method used for solving an assignment problem is: a. Reduced matrix method b. MODI method c. Hungarian method d. None of these
Last Answer : c. Hungarian method
Description : Who defined Operations Research as scientific approach to problem solving for executive management. a. E L Arnoff b. H M Wagner c. Churchman d. None of these
Last Answer : b. H M Wagner
Description : By the beginning of ........................., the industries in USA realised the importance of Management Science in solving business and management problems. a. 1930s b. 1940s c. 1950s d. 1960s
Last Answer : c. 1950s
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 : The following transportation problem: The above solution of a given transportation problem is (A) infeasible solution (B) optimum solution (C) non-optimum solution (D) unbounded solution
Last Answer : (B) optimum 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 : Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation Method(VAM) is given below: The solution of the ... degenerate solution (B) is optimum solution (C) needs to improve (D) is infeasible solution
Last Answer : (B) is optimum solution
Description : A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced
Description : Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function ... S1 and S2 (B) S1 and S3 (B) S2 and S3 (D) S1, S2 and S2
Last Answer : (D) S1, S2 and S2
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 : 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
Description : 66. Which method is an iterative procedure for solving LPP in a finite number of steps? a. Simplex algorithm b. Slack variable c. Big M method d. Simplex method
Last Answer : d. Simplex method
Description : ............................refers to the manner in which the customers behave while being in the queue. a. Service pattern b. Service pattern c. Queue discipline d. None of these
Last Answer : c. Queue discipline
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