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

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
by

1 Answer

Answer :

a. Represent optimal solutions
by

Related questions

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

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

50. Which of the following statements is true with respect to the optimal solution of an LP problem? a. Every LP problem has an optimal solution b. Optimal solution of an LP problem always occurs at an extreme point c. At optimum solution all resources are completely used d. If an optimal solution exists, there will always be at least one at a corner

Description : 50. Which of the following statements is true with respect to the optimal solution of an LP problem? a. Every LP problem has an optimal solution b. Optimal solution of an LP problem always occurs ... completely used d. If an optimal solution exists, there will always be at least one at a corner

Last Answer : d. If an optimal solution exists, there will always be at least one at a corner

59. Alternative solutions exist of an LP model when a. One of the constraints is redundant b. Objective function equation is parallel to one of the constraints c. Two constraints are parallel d. All of the above

Description : 59. Alternative solutions exist of an LP model when a. One of the constraints is redundant b. Objective function equation is parallel to one of the constraints c. Two constraints are parallel d. All of the above

Last Answer : b. Objective function equation is parallel to one of the constraints

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

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

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

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

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

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

62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above

Description : 62. If one of the constraint of an equation in an LP problem has an unbounded solution, then a. Solution to such LP problem must be degenerate b. Feasible region should have a line segment c. Alternative solutions exists d. None of the above

Last Answer : b. Feasible region should have a line segment

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

29. A constraint in an LP model restricts a. Value of objective function b. Value of a decision variable c. Use of the available resources d. All of the above

Description : 29. A constraint in an LP model restricts a. Value of objective function b. Value of a decision variable c. Use of the available resources d. All of the above

Last Answer : d. All of the above

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

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

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

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

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 work with formal models c. It captures the relevant relationship among decision factors d. It enables the use of algebraic technique

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

. Non-negativity condition in an LP model implies a. A positive coefficient of variables in objective function b. A positive coefficient of variables in any constraint c. Non-negative value of resources d. None of the above

Description : . Non-negativity condition in an LP model implies a. A positive coefficient of variables in objective function b. A positive coefficient of variables in any constraint c. Non-negative value of resources d. None of the above

Last Answer : d. None of the Above

51. An iso-profit line represents a. An infinite number of solutions all of which yield the same profit b. An infinite number of solutions all of which incurs the same cost c. An infinite number of optimal solutions d. A boundary of the feasible region

Description : 51. An iso-profit line represents a. An infinite number of solutions all of which yield the same profit b. An infinite number of solutions all of which incurs the same cost c. An infinite number of optimal solutions d. A boundary of the feasible region

Last Answer : . An infinite number of solutions all of which yield the same profit

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

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

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

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

61. If a non-redundant constraint is removed from an LP problem then a. Feasible region will become larger b. Feasible region will become smaller c. Solution will become infeasible d. None of the above

Description : 61. If a non-redundant constraint is removed from an LP problem then a. Feasible region will become larger b. Feasible region will become smaller c. Solution will become infeasible d. None of the above

Last Answer : a. Feasible region will become larger

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

48. The graphical method of LP problem uses a. Objective function equation b. Constraint equations c. Linear equations 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

Last Answer : d. All of the above

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

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

55. If two constraints do not intersect in the positive quadrant of the graph, then a. The problem is infeasible b. The solution is unbounded c. One of the constraints is redundant d. None of the above

Description : 55. If two constraints do not intersect in the positive quadrant of the graph, then a. The problem is infeasible b. The solution is unbounded c. One of the constraints is redundant d. None of the above

Last Answer : a. The problem is infeasible

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

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

54. A constraint in an LP model becomes redundant because a. Two iso-profits may be parallel to each other b. The solution is unbounded c. This constraint is not satisfied by the solution values d. None of the above

Description : 54. A constraint in an LP model becomes redundant because a. Two iso-profits may be parallel to each other b. The solution is unbounded c. This constraint is not satisfied by the solution values d. None of the above

Last Answer : d. None of the above

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

39. Which of the following is an assumption of an LP model a. Divisibility b. Proportionality c. Additivity d. All of the above

Description : 39. Which of the following is an assumption of an LP model a. Divisibility b. Proportionality c. Additivity d. All of the above

Last Answer : d. All of the above

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

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

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

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

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

A basic solution which also satisfies the condition in which all basic variables are non-negative is called ___ a. Basic feasible solution b. Feasible solution c. Optimal solution d. None of the above

Description : A basic solution which also satisfies the condition in which all basic variables are non-negative is called ___ a. Basic feasible solution b. Feasible solution c. Optimal solution d. None of the above

Last Answer : a. Basic feasible solution

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

An objective function which states the determinants of the quantity to be either maximized or minimized is called_______ a. Feasible function b. Optimal function c. Criterion function d. None of the above

Description : An objective function which states the determinants of the quantity to be either maximized or minimized is called_______ a. Feasible function b. Optimal function c. Criterion function d. None of the above

Last Answer : b. Optimal function

Which variables are fictitious and cannot have any physical meaning? a. Optimal variable b. Decision variable c. Artificial variable d. None of the above

Description : Which variables are fictitious and cannot have any physical meaning? a. Optimal variable b. Decision variable c. Artificial variable d. None of the above

Last Answer : c. Artificial variable

52. If an iso-profit yielding the optimal solution coincides with a constraint line, then a. The solution is unbounded b. The solution is infeasible c. The constraint which coincides is redundant d. None of the above

Description : 52. If an iso-profit yielding the optimal solution coincides with a constraint line, then a. The solution is unbounded b. The solution is infeasible c. The constraint which coincides is redundant d. None of the above

Last Answer : d. None of the above

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

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

If there were n workers & n jobs there would be a. N! solutions b. (n-1)! Solutions c. (n!)n solutions d. N Solutions

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

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

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

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

If the number of jobs is not equal to the number of resources, then the problem is term as _____ assignment problem a. Balanced b. Unbalanced c. Equal d. Unequal

Description : If the number of jobs is not equal to the number of resources, then the problem is term as _____ assignment problem a. Balanced b. Unbalanced c. Equal d. Unequal

Last Answer : b. Unbalanced

If the number of jobs is equal to the number of resources, then the problem is term as _____ assignment problem a. Balanced b. Unbalanced c. Equal d. Unequal

Description : If the number of jobs is equal to the number of resources, then the problem is term as _____ assignment problem a. Balanced b. Unbalanced c. Equal d. Unequal

Last Answer : a. Balanced

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 problemsc. Variables are interrelated in terms of limited resources d. None of the above

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

An optimum solution is considered the _____ among feasible solutions a. Worst b. Best c. Ineffective d. None of the above

Description : An optimum solution is considered the _____ among feasible solutions a. Worst b. Best c. Ineffective d. None of the above

Last Answer : b. Best

35. Which of the following is not a characteristic of the L P model a. Alternative courses of actions b. An objective function of maximization type c. Limited amount of resources d. Non-negativity condition on the value of decision variable

Description : 35. Which of the following is not a characteristic of the L P model a. Alternative courses of actions b. An objective function of maximization type c. Limited amount of resources d. Non-negativity condition on the value of decision variable

Last Answer : b. An objective function of maximization type

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

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

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

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

An assumption that implies that finite numbers of choices are available to a decision-maker and the decision variables do not assume negative values is known as _______ a. Certainty b. Continuity c. Finite choices d. None of the above

Description : An assumption that implies that finite numbers of choices are available to a decision-maker and the decision variables do not assume negative values is known as _______ a. Certainty b. Continuity c. Finite choices d. None of the above

Last Answer : c. Finite choices

_________ technique helps to make a choice from numerous available alternatives a. PERT b. CPM c. Linear Programming d. Transportation

Description : _________ technique helps to make a choice from numerous available alternatives a. PERT b. CPM c. Linear Programming d. Transportation

Last Answer : d. Transportation

. 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