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 : ........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources. a. Goal programming b. Linear programming c. Decision making d. None of these
Last Answer : b. Linear programming
Description : Which of the followings is an assumption of Linear Programming Technique? a. Divisibility b. Additivity c. Proportionality d. All of the above
Last Answer : d. All of the above
Description : Linear Programming technique is a: a. Constrained optimisation technique b. Technique for economic allocation of resources c. Mathematical technique d. All of the above
Description : .................... is considered as the pioneer of Linear Programming Technique. a. churchman b. D W Miller c. James Lundy d. George B Dantzig
Last Answer : d. George B Dantzig
Description : A constraint in a Linear Programming Model restricts: a. Value of objective function b. Value of decision variable c. Use of available resources d. All of the above
Description : Which of the following method is used to solve mixed strategy problems: a. Probability method b. Graphic method c. Linear Programming method d. All of the above
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 : Which of the following is true with regard to a Linear Programming Model? a. No guarantee to get integer valued solution b. The relationship among decision variables is liner c. Both a and b d. None of the these
Last Answer : d. None of the these
Description : ............................... is concerned with determination of the most economic replacement policy. a. Probabilistic programming b. Linear programming c. Search theory d. Replacement theory
Last Answer : d. Replacement theory
Description : Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these
Last Answer : b. Dual
Description : In Linear Programming Problem, degeneracy occurs in ................. stages. a. One b. Two c. Three d. Four
Last Answer : b. Two
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 : 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 : All the parameters in the linear programming model are assumed to be ..................... a. Variables b. Constraints c. Functions d. None of these
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 O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory
Last Answer : b. Queuing theory
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
Last Answer : c. VAM
Description : When all the players of the game follow their optimal strategies, then the expected pay off of the game is called....................... a. Gain of the game b. Loss of the game c. Value of the game d. None of these
Last Answer : c. Value of the game
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 : ........................ is applied to determine optimal solution. a. NWCR b. VAM c. MODI Method d. None of these
Last Answer : c. MODI Method
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 : 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 : Operations Research makes a ...................... attack on complex problems to arrive at optimal solution. a. Scientific b. Systematic c. Both a and b d. None of these
Last Answer : c. Both a and b
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 : _________ technique helps to make a choice from numerous available alternatives a. PERT b. CPM c. Linear Programming d. Transportation
Last Answer : d. Transportation
Description : ...................... is a method of analysing the current movement of the some variable in an effort to predict the future movement of the same variable. a. Goal programming b. Queuing theory c. Markov Analysis d. Replacement theory
Last Answer : c. Markov Analysis
Description : Graphic method can be applied to solve a liner programming problem when there are only ........................... variables a. A one b. Two c. Three d. More than three
Description : The graphical method if LPP uses: a. Linear equations b. Constraint equations c. Objective function d. All of the above
Description : Operations Research does not give perfect solution to a problem, but it helps to improve the ......................... of the solution. a. Quality b. Clarity c. Look d. None of these
Last Answer : a. Quality
Description : PERT stand for: a. Performance Evaluation Review Technique b. Programme Evaluation Review Technique c. Programme Evaluation Research Technique
Last Answer : b. Programme Evaluation Review Technique
Description : ....................... is an important Operations Research Technique to analyse the queuing behaviour. a. Game theory b. Waiting line theory c. Decision theory d. Simulation
Last Answer : b. Waiting line theory
Description : A linear programm A linear programming model CANNOT be used when whic ing model CANNOT be used when which of the followin h of the following are true? g are true? a)An optimal ... set of linear constraints may be defined d)Cross product relationships exist between two or more decision variables
Last Answer : d)Cross product relationships exist between two or more decision variables
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 : 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 : Which of the following is a location analysi analysis technique chnique typically e cally employed mployed by a service organization? a. purchasing power analysis b. linear linear programming c. queuing theory d. crossover charts e. cost-volume cost-volume analysis
Last Answer : a. purchasing power analysis
Description : If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these
Last Answer : c. 0
Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables
Last Answer : d. Decision variables
Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these
Last Answer : b. Uncontrollable variables
Description : The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these
Last Answer : a. Controllable variables
Description : The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity
Last Answer : b. Service facility
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 : Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig
Last Answer : c. D Konig
Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above
Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these
Last Answer : b. Penalty Method
Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock
Last Answer : d. F L Hitchcock
Description : ................................is that element of the simplex table which lis both in the key row and key column. a. Key element b. Pivot element c. Both a and b d. None of these
Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these
Last Answer : a. Dual price
Description : Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern
Last Answer : d. Von-neumann and Morgenstern