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

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
by

1 Answer

Answer :

. An infinite number of solutions all of which yield the same profit
by

Related questions

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

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

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

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

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

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

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

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

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

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

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

The second longest path in the network diagram is called a. Alternate b. Feasible c. Sub-critical d. Critical

Description : The second longest path in the network diagram is called a. Alternate b. Feasible c. Sub-critical d. Critical

Last Answer : c. Sub-critical

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

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

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

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

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

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

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

An optimal solution is considered as the ................... among the feasible solutions. a. Worst b. Best c. Ineffective d. None of these

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

For maximization in assignment problem, the objective is to maximize the a. Profit b. Optimization c. Cost d. None of the above

Description : For maximization in assignment problem, the objective is to maximize the a. Profit b. Optimization c. Cost d. None of the above

Last Answer : a. Profit

. 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

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

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

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

An objective function is maximized when it is a _______ function a. Passive b. Profit c. Cost d. None of the above

Description : An objective function is maximized when it is a _______ function a. Passive b. Profit c. Cost d. None of the above

Last Answer : b. Profit

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

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

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

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

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

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. Unbalanced and Maximization Transportation problem c. Balanced and Maximization Assignment problem d. Unbalanced and Maximization Assignment 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

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

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

If profit, sales, production, etc is given then it is _________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem

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

Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix

Description : Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix

Last Answer : c. Regret matrix

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

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

A sells an article to B making a profit of 1/5 th his outlay. B sells it to C, gaining 20%. If C sells it for Rs 600 and incurs a loss of 1/6 th his outlay, the cost price of A is: 1. Rs 600 2. Rs 500 3. Rs 720 4. Rs 800

Description : A sells an article to B making a profit of 1/5 th his outlay. B sells it to C, gaining 20%. If C sells it for Rs 600 and incurs a loss of 1/6 th his outlay, the cost price of A is: 1. Rs 600 2. Rs 500 3. Rs 720 4. Rs 800

Last Answer : 1. Rs 600

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

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

If cost, time, etc is given, then it is ________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem

Description : If cost, time, etc is given, then it is ________ a. Balanced problem b. Unbalanced problem c. Maximization problem d. Minimization problem

Last Answer : d. Minimization problem

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

Last Answer : d. All of the above

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

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

Operations Research techniques help to find ................... solution. a. Feasible solution b. Infeasible solution c. Optimal solution d. None of these

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

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

A person, by selling an article at half of the list price incurs a loss of 20%. Find the profit percentage if he sells at the list price? A. 25% B. 60% C. 5% D. 30 %

Description : A person, by selling an article at half of the list price incurs a loss of 20%. Find the profit percentage if he sells at the list price? A. 25% B. 60% C. 5% D. 30 %

Last Answer : Answer – B (60 %) Explanation – 0.50 MP = 0.8 CP (since 20% loss) So, MP = 160CP ⇒ 60% gain.

Deepak selling a product at 48% discount, he incurs a loss of 10%. The marked price of the product is 15000 Rs. At what percent discount he should sell the product so as to have a profit of 30%.

Description : Deepak selling a product at 48% discount, he incurs a loss of 10%. The marked price of the product is 15000 Rs. At what percent discount he should sell the product so as to have a profit of 30%.

Last Answer : Mp=15000==>Sp= 15000*0.52= 7800. Loss of 10% is there==>Cp= 7800/ 0.90= RS.8666.66 Profit of 30% = 6000*1.15=11266.66 Discount should be Rs2600 Discount % should be {2600/15000}*100 =17.3%

By selling a mobile at 52% discount, a seller incurs a loss of 8%. The marked price of the product is 18000 Rs. At what percent discount the seller should sell the mobile so as to have a profit of 33%.

Description : By selling a mobile at 52% discount, a seller incurs a loss of 8%. The marked price of the product is 18000 Rs. At what percent discount the seller should sell the mobile so as to have a profit of 33%.

Last Answer : Since, Marked Price = 18000 Therefore, Selling Price = 18000*0.48 = 8640 Loss of 8% is there Therefore, Cost price = 8640/0.92 = 9391.30Rs To have profit of 33% The Selling Price should be = 9391. ... should be 18000 - 12490.42 = 5509.58Rs Discount% should be [5509.58/18000]*100 = 30.60 ≈ 31%.

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. Unbalanced and Minimization Transportation problem c. Balanced and Minimization Assignment problem d. Unbalanced and Minimization Assignment 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

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

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