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

1 Answer

Answer :

c. Both a & b

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 : 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 : ________ 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 : 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 : 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 helps to make a choice from numerous available alternatives a. PERT b. CPM c. Linear Programming d. Transportation

Last Answer : d. Transportation

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

Last Answer : 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 : 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 : 44. The word “Programming” means taking decisions ______ a. Systematically b. Rapidly c. Slowly d. Instantly

Last Answer : a. Systematically

Description : 48. The graphical method of LP problem uses a. Objective function equation b. Constraint equations c. Linear equations d. All of the above

Last Answer : d. All of the above

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

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

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

Last Answer : a. CPM

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

Last Answer : c. Technique

Description : All the constraints are expressed as equations and the right hand side of each constraint and all variables are non-negative is called_______ a. Canonical variable b. Canonical form c. Canonical solution d. Both a & b

Last Answer : b. Canonical form

Description : 57. The solution space(region) of an LP problem is unbounded due to a. An incorrect formulation of the LP model b. Objective function is unbounded c. Neither a nor b d. Both a & b

Last Answer : b. Objective function is unbounded c. Neither a nor b

Description : 56. Constraints in LP problem are called active if they a. Represent optimal solutions b. At optimality do not consume all the available resources c. Both a & b d. None of the above

Last Answer : a. Represent optimal solutions

Description : 34. Maximization of objective function in an L P model means a. Value occurs at allowable set of decisions b. Highest value is chosen among allowable decisions c. Neither of above d. Both a & b

Last Answer : a. Value occurs at allowable set of decision

Description : 26. Operations Research is a _________ a. Science b. Art c. Mathematics d. Both a & b

Last Answer : d. Both a & b

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 : 5. Operations Research was known as an ability to win a war without really going into a _____ a. Battle Field b. Fighting c. War d. Both a & b

Last Answer : d. Both a & b

Description : 2. Who coined the term Operations Research? a. J.F. McCloskey b. F.N. Trefethen c. P.F. Adams d. Both a & b

Last Answer : a. J.F. McCloskey

Description : . For __________ minimization, we take least value from each column and subtract it from all values of that column. a. Column b. Row c. Profit d. Cost

Last Answer : a. Column

Description : For __________ minimization, we take least value from each row and subtract it from all values of that row. a. Column b. Row c. Profit d. Cost

Last Answer : b. Row

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 : If there were n workers & n jobs there would be a. N! solutions b. (n-1)! Solutions c. (n!)n solutions d. N Solutions

Last Answer : a. N! solutions

Description : An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of a. Rows or columns b. Rows & columns c. Rows + columns -1 d. None of the above

Last Answer : b. Rows & columns

Description : 2. Non-Negativity condition is an important component of L P model because a. Variables value should remain under the control of the decision-maker b. Value of variables make sense & correspond to real-world problems c. Variables are interrelated in terms of limited resources d. None of the above

Last Answer : b. Value of variables make sense & correspond to real-world problems

Description : 31. Constraints in an LP model represents a. Limitations b. Requirements c. Balancing limitations & requirements d. All of the above

Last Answer : d. All of the above

Description : 27. The mathematical model of an LP problem is important because a. It helps in converting the verbal description & numerical data into mathematical expression b. Decision-makers prefer to ... captures the relevant relationship among decision factors d. It enables the use of algebraic technique

Last Answer : a. It helps in converting the verbal description & numerical data into mathematical expression

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

Last Answer : Player

Description : Which of these is not a type of steam generator depending upon the kind of applications? (rra) utility steam generators (rrb) marine steam generators ( c) agricultural steam generators (rrd) industrial steam generators

Last Answer : ( c) agricultural steam generators

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

Last Answer : b. Payoff

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

Last Answer : c. Play

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

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

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

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

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

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

Last Answer : d. Players

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

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

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

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