Maximization assignment problem is transformed into a minimization problem by a. Adding each entry in a column from the maximization value in that column b. Subtracting each entry in a column from the maximum value in that column c. Subtracting each entry in a column from the maximum value in that table d. Any one of the above

Maximization assignment problem is transformed into a minimization problem by
a.
Adding each entry in a column from the maximization value in that column
b.
Subtracting each entry in a column from the maximum value in that column
c.
Subtracting each entry in a column from the maximum value in that table
d.
Any one of the above
by

1 Answer

Answer :

c.
Subtracting each entry in a column from the maximum value in that table
by

Related questions

The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table from the maximum value in that table. (C) adding each entry in a column from the maximum value in that column. (D) adding maximum value of the table to each entry in the table.

Description : The given maximization assignment problem can be converted into a minimization problem by (A) subtracting each entry in a column from the maximum value in that column. (B) subtracting each entry in the table ... value in that column. (D) adding maximum value of the table to each entry in the table.

Last Answer : (B) subtracting each entry in the table from the maximum value in that table.

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

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

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

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

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

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

If in an assignment problem, number of rows is not equal to number of columns then a. Maximization problem b. Problem is unbalanced c. Problem is degenerate d. Optimum solution is not possible

Description : If in an assignment problem, number of rows is not equal to number of columns then a. Maximization problem b. Problem is unbalanced c. Problem is degenerate d. Optimum solution is not possible

Last Answer : c. Problem is degenerate

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

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

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

The extra row or column which is added to balance an assignment problem is called _____ a. Regret b. Epsilon c. Dummy d. extra 98.

Description : The extra row or column which is added to balance an assignment problem is called _____ a. Regret b. Epsilon c. Dummy d. extra

Last Answer : c. Dummy

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

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

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

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

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

___ 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

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

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

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

When a particular assignment in the given problem is not possible or restricted as a condition, it is called a __ problem a. Infeasible b. Degenerate c. Unbalanced d. Prohibited

Description : When a particular assignment in the given problem is not possible or restricted as a condition, it is called a __ problem a. Infeasible b. Degenerate c. Unbalanced d. Prohibited

Last Answer : d. Prohibited

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

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

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

What is the m What is the major differe ajor difference in focus bet nce in focus between locat ween location decision ion decisions in the service sect s in the service sector and in or and in the manufacturing sector? a)There is no difference in focus b)The focus in manufacturing is revenue maximization, while the focus in service is cost minimization c)The focus in service is revenue maximization, while the focus in manufacturing is cost minimization d)The focus in manufacturing is on raw materials, while the focus in service is on labour

Description : What is the m What is the major differe ajor difference in focus bet nce in focus between locat ween location decision ion decisions in the service sect s in the service sector and in or and ... minimization d)The focus in manufacturing is on raw materials, while the focus in service is on labour

Last Answer : c)The focus in service is revenue maximization, while the focus in manufacturing is cost minimization

Which statute governs external commercial borrowing? e) Foreign Exchange Maximization Act, 1972 f) Foreign Exchange Management Act, 1999 g) Foreign Exchange Minimization Act, 2004 h) Foreign Exchange Regulation Act, 1972

Description : Which statute governs external commercial borrowing? e) Foreign Exchange Maximization Act, 1972 f) Foreign Exchange Management Act, 1999 g) Foreign Exchange Minimization Act, 2004 h) Foreign Exchange Regulation Act, 1972

Last Answer : f) Foreign Exchange Management Act, 1999

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

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

Last Answer : d. SQC

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

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

Last Answer : a. CPM

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

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

What do you think of this explanation of why subtracting a negative is the same as adding a positive?

Description : What do you think of this explanation of why subtracting a negative is the same as adding a positive?

Last Answer : I should have added that if you accept that subtracting a positive is the same as adding a negative then it follows that subtracting a negative is the same as adding a positive.

In quadrantal bearing system, back bearing of a line may be obtained from its forward bearing, by (A) Adding 180°, if the given bearing is less than 180° (B) Subtracting 180°, if the given bearing, is more than 180° (C) Changing the cardinal points, i.e. substituting N for S and E for W and vice-versa (D) None of these

Description : In quadrantal bearing system, back bearing of a line may be obtained from its forward bearing, by (A) Adding 180°, if the given bearing is less than 180° (B) Subtracting 180°, if the given bearing, is more ... cardinal points, i.e. substituting N for S and E for W and vice-versa (D) None of these

Last Answer : (C) Changing the cardinal points, i.e. substituting N for S and E for W and vice-versa

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

________ 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

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

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

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

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

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

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

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

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

Pick up the incorrect statement from the following a. The activity which consumes maximum time, is called a node b. The activity is the time consuming part of a project c. The beginning and end of a job, are called events d. Logically and sequentially connected activities and events form a network

Description : Pick up the incorrect statement from the following a. The activity which consumes maximum time, is called a node b. The activity is the time consuming part of a project c. The beginning ... of a job, are called events d. Logically and sequentially connected activities and events form a network

Last Answer : a. The activity which consumes maximum time, is called a node

. 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

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

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