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

1 Answer

Answer :

d. All of the above

Related questions

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 : 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 : ________ 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 : 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 : What is the benefit of using PERT/CPM network as integral component of project management? a. They furnish a consistent framework for planning, scheduling, monitoring and controlling project b. They illustrate ... that the project will be completed by a specific date d. All of the above

Last Answer : d. All of the above

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

Last Answer : d. All of the above

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 : 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 : 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 : 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 : ___ 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 : 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 : 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 : 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 : 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 : 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 : 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 : 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 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

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 : _____ technique is related to Inventory management a. EOQ b. SQC c. CPM d. transportation

Last Answer : a. EOQ

Description : ________ technique is related to Quality control a. Assignment b. Transportation c. CPM d. SQC

Last Answer : d. SQC

Description : ______ are technique applied in project management a. CPM b. Assignment c. Transportation d. Decision theory

Last Answer : a. CPM

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 : 37. Which of the following is not a characteristics of the LP a. Resources must be limited b. Only one objective function c. Parameters value remains constant during the planning period d. The problem must be of minimization type

Last Answer : d. The problem must be of minimization type

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

Description : . Operations Research involves _________ attacks of complex problems to arrive at the optimum solution a. Scientific b. Systematic c. Both a & b d. Statistical

Last Answer : c. Both a & b

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 : 12. Operations Research involves various _______ to solve the problems a. Decisions b. Study c. Technique d. Applications

Last Answer : c. Technique

Description : 10. There is a great scope for ______ working as a team to solve problems of defence by using the Operations Research approach a. Economists b. Administrators c. Statisticians and Technicians d. All of the Above

Last Answer : d. All of the Above

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

Last Answer : a. Feasible region

Description : A clothing store that sets their advertising budget by following the major competitor and adding an additional 15 per cent is using the method 1. percentage of sales 2. arbitrary allocation 3. objective and task 4. competitive parity 5. None of these

Last Answer : competitive parity

Description : 'Logical incrementalism' can be described as: A. Careful design and planning B. Emergent C. Cautious resource allocation D. Top management rational analysis

Last Answer : Top management rational analysis

Description : 'Logical incrementalism' can be described as: A. Careful design and planning B. Emergent C. Cautious resource allocation D. Top management rational analysis

Last Answer : Top management rational analysis

Description : In operationg system, Round Robin Scheduling means : (1) A kind of scheduling (2) Repetition policy (3) A memory allocation policy (4) A process allocation policy

Last Answer : A kind of scheduling

Description : The work of setting up objectives for selling activities, determining and scheduling the steps necessary to achieve these objectives is known as…………. A. Selling B. Sales policy C. Sales programme D. Sales planning

Last Answer : D. Sales planning

Description : Which of the following statements is not true about disk-arm scheduling algorithms ? (A) SSTF (shortest seek time first) algorithm increases performance of FCFS. (B) The number of requests for disk ... arm movements. (D) SCAN and C-SCAN algorithms are less likely to have a starvation problem.

Last Answer : (B) The number of requests for disk service are not influenced by file allocation method.

Description : Brainstorming is used by the management for 1. Work allocation of the shop floor 2. Generating alternative for problem solving 3. The promotion of research and development 4. Training employees 5. None of these

Last Answer : Generating alternative for problem solving

Description : Every combination of strategies determines an outcome known as _____ a. Regret b. Payoff c. Saddle point d. Profit matrix

Last Answer : b. Payoff