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 : 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 : _________ technique helps to make a choice from numerous available alternatives a. PERT b. CPM c. Linear Programming d. Transportation
Last Answer : d. Transportation
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 : 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 : 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 : 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 : _____ 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 : How many methods are there to solve LPP? a. Three b. Two c. Four d. None of the above
Last Answer : b. Two
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 : 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 : 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 : 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 : 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 : 36. The best use of linear programming technique is to find an optimal use of a. Money b. Manpower c. Machine d. All of the above
Last Answer : . All of the above
Description : 28. Linear programming is a a. Constrained optimization technique b. Technique for economic allocation of limited resources c. Mathematical technique d. All of the above
Last Answer : b. Technique for economic allocation of limited resource
Description : ________ technique is related to Quality control a. Assignment b. Transportation c. CPM d. SQC
Last Answer : d. SQC
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 : 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
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 : 48. The graphical method of LP problem uses a. Objective function equation b. Constraint equations c. Linear equations d. All of the above
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 : _____ 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 : 44. The word “Programming” means taking decisions ______ a. Systematically b. Rapidly c. Slowly d. Instantly
Last Answer : a. Systematically
Description : 53. While plotting constraints on a graph paper, terminal points on both the axes are connected by straight line because a. The resources are limited in supply b. The objective function as a linear function c. The constraints are linear equations or inequalities d. All of the above
Last Answer : c. The constraints are linear equations or inequalities
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 : 40. Which of the following is a limitation associated with an LP model a. The relationship among decision variables is linear b. No guarantee to get integer valued solutions c. No considerations of effect of time & uncertainty on LP model d. All of the above
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 : 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 : Backward pass calculations are done to find ________ occurrence times of events a. Tentative b. Definite c. Latest d. Earliest
Last Answer : c. Latest
Description : . Operations Research techniques helps to find an ________ by taking into account all the factors a. Ultimate solution b. Alternate solution c. Optimum solution d. Maximise solution
Last Answer : c. Optimum solution
Description : 4. This Innovative science of Operations Research was discovered during ________ a. Civil War b. World War I c. World War II d. Industrial Revolution
Last Answer : c. World War II
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 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 : 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 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 : 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 : 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 : 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 : 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 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 : 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