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

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
by

1 Answer

Answer :

a. Business problems
by

Related questions

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

66. Which method is an iterative procedure for solving LPP in a finite number of steps? a. Simplex algorithm b. Slack variablec. Big M method d. Simplex method

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

46. Linear programming has been successfully applied in __________ a. Agricultural b. Industrial applications c. Both a & b d. manufacturing

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

Every LPP is associated with another LPP is called_____ a. Primal b. Dual c. Non-linear programming d. None 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

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

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

________ which is a subclass of a linear programming problem(LPP) a. Programming problem b. Transportation problem c. Computer problem d. All of the above

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

BFS in LPP stands for: a. Best Feasible solution b. Better feasible solution c. Basic feasible solution d. None of the above

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

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

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

_____ 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

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

How many methods are there to solve LPP? a. Three b. Two c. Four d. None of the above

Description : How many methods are there to solve LPP? a. Three b. Two c. Four d. None of the above

Last Answer : b. Two

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

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

64. If the feasible region of a LPP is empty, the solution is _______ a. Infeasible b. Unbounded c. Alternative d. None of the above

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

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

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?

For solving an assignment problem, which method is used? a. British b. American c. German d. None of the above

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

. 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

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

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 assignment to zero c. Reduce the cost of that particular assignment to zero d. All of the above

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

60. While solving a LP problem, infeasibility may be removed by a. Adding another constraint b. Adding another variablec. Removing a constraint d. Removing a variable

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

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

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

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

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

___ is one of the fundamental combinatorial optimization problems a. Assignment problem b. Transportation problem c. Optimization problem d. None of the above

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

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

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

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

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

13. Operations Research cannot give perfect _____ to problems a. Answers b. Solutions c. Both a & b d. Decisions

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

12. Operations Research involves various _______ to solve the problems a. Decisions b. Study c. Technique d. Applications

Description : 12. Operations Research involves various _______ to solve the problems a. Decisions b. Study c. Technique d. Applications

Last Answer : c. Technique

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

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

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

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

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

45. LP is a major innovations since _______ in the field of business decision-making, particularly under conditions of certainty a. Industrial Revolution b. World War I c. World War II d. French Revolution

Description : 45. LP is a major innovations since _______ in the field of business decision-making, particularly under conditions of certainty a. Industrial Revolution b. World War I c. World War II d. French Revolution

Last Answer : c. World War II

Operations Research techniques cannot be applied to _____ a. Managerial judgement b. Business initiatives c. Customer perceptions d. All of the above

Description : Operations Research techniques cannot be applied to _____ a. Managerial judgement b. Business initiatives c. Customer perceptions d. All of the above

Last Answer : c. Customer perceptions

In order to promote the participation of students in agricultural business, Student scheme is being run, under which practical experience of agriculture is provided to undergraduate students, what does “E” stand for in READY? a. Export b. Empowerment c. Enlightenment d. Entrepreneurship

Description : In order to promote the participation of students in agricultural business, Student scheme is being run, under which practical experience of agriculture is provided to undergraduate students, what does “E” stand for in READY? a. Export b. Empowerment c. Enlightenment d. Entrepreneurship

Last Answer : d. Entrepreneurship

In order to promote the participation of students in agricultural business, Student scheme is being run, under which practical experience of agriculture is provided to undergraduate students, what does “E” stand for in READY? a. Export b. Empowerment c. Enlightenment d. Entrepreneurship

Description : In order to promote the participation of students in agricultural business, Student scheme is being run, under which practical experience of agriculture is provided to undergraduate students, what does “E” stand for in READY? a. Export b. Empowerment c. Enlightenment d. Entrepreneurship

Last Answer : d. Entrepreneurship

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

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

Last Answer : b. Payoff

The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player

Description : The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player

Last Answer : Player

A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game

Description : A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game

Last Answer : c. Play

A ______ is the one in which the player selects more than one strategy with fixed probabilities before playing the game. a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Description : A ______ is the one in which the player selects more than one strategy with fixed probabilities before playing the game. a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Last Answer : d. Impure strategy

A _______ provides a complete definition of how a player will play a game a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Description : A _______ provides a complete definition of how a player will play a game a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Last Answer : c. Complete strategy

The various alternatives or courses of actions available to each player in a game are called as ____ a. Saddle points b. Strategies c. Pay-off d. Gains

Description : The various alternatives or courses of actions available to each player in a game are called as ____ a. Saddle points b. Strategies c. Pay-off d. Gains

Last Answer : b. Strategies

A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is called___ a. Centre point b. Main point c. Saddle point d. Equal point

Description : A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is called___ a. Centre point b. Main point c. Saddle point d. Equal point

Last Answer : c. Saddle point

In a game, the alternatives or courses of action available to each player are called _____ a. Options b. Choices c. Actions d. strategies

Description : In a game, the alternatives or courses of action available to each player are called _____ a. Options b. Choices c. Actions d. strategies

Last Answer : d. strategies

The participants in a game are called ______ a. Clients b. Members c. Customers d. Players

Description : The participants in a game are called ______ a. Clients b. Members c. Customers d. Players

Last Answer : d. Players

. In a zero-sum game, a. What one player wins, the other loses b. The sum of each player’s winnings if the game is played many times must be zero c. The game is fair-each person has an equal chance of winning d. Long-run profits must be zero

Description : . In a zero-sum game, a. What one player wins, the other loses b. The sum of each player’s winnings if the game is played many times must be zero c. The game is fair-each person has an equal chance of winning d. Long-run profits must be zero

Last Answer : a. What one player wins, the other loses

A common assumption about the players in a game is that a. Neither player knows the payoff matrix b. The players have different information about the payoff matrix c. Only one of the players pursues a rational strategy d. The specific identify of the players is irrelevant to the play of the game

Description : A common assumption about the players in a game is that a. Neither player knows the payoff matrix b. The players have different information about the payoff matrix c. Only one of the players pursues a rational strategy d. The specific identify of the players is irrelevant to the play of the game

Last Answer : d. The specific identify of the players is irrelevant to the play of the game

A strategy that is best regardless of what rival players do is called a. First-mover advantage b. A Nash equilibrium strategy c. Tit-for-tat d. A dominant strategy

Description : A strategy that is best regardless of what rival players do is called a. First-mover advantage b. A Nash equilibrium strategy c. Tit-for-tat d. A dominant strategy

Last Answer : d. A dominant strategy

In game theory, the outcome or consequence of a strategy is referred to as the a. Payoff b. Penalty c. Reward d. End-game strategy

Description : In game theory, the outcome or consequence of a strategy is referred to as the a. Payoff b. Penalty c. Reward d. End-game strategy

Last Answer : a. Payoff

What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point

Description : What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point

Last Answer : c. Imbalanced growth point

What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point

Description : What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point

Last Answer : a. Equilibrium point

Who developed the Game Theory a. J.R. Hicks b. William J. Baumol c. Neumann Morgenstern d. Samuelson P.T.

Description : Who developed the Game Theory a. J.R. Hicks b. William J. Baumol c. Neumann Morgenstern d. Samuelson P.T.

Last Answer : c. Neumann Morgenstern

In project crashing, as we systematically, crash the project, direct cost of project ______ a. Increases b. Decreases c. Remain same d. None of the above

Description : In project crashing, as we systematically, crash the project, direct cost of project ______ a. Increases b. Decreases c. Remain same d. None of the above

Last Answer : a. Increases

Floats for critical activities will be always _____ a. One b. Zero c. Highest d. Same as duration of the activity

Description : Floats for critical activities will be always _____ a. One b. Zero c. Highest d. Same as duration of the activity

Last Answer : b. Zero