Assignment Problems — Quiz It!

The following are descriptions of Assignment Problems EXCEPT:

• Assignment problems are an optimization technique which comprises of linear constraints and a linear objective function.

• Assignment problems (AP) are a unique form of linear programming issues that are focused on the assigning of different types of merchandise.

• The goal of assignment problems are to find the optimal assignment, minimizing the expenses and the like.

• Assignment problems emerge on the grounds that accessible assets, for example, men, machines and so on.

Assignment problems (AP) are applied and seen in which of the following fields:

• Dietary Plans

• Business

• Transportation

• Distribution of tasks

Which of the following is NOT considered as an assumption in an assignment problem?

• The number of assignees and number of task are equal (this number is denoted by n).

• Each assignee is to be assigned to perform exactly one task.

• Each task is to be performed by exactly one assignee.

• There is no cost or profit associated with assignees performing different task.

What is an assignment table?

• The assignment table does not display the data in relation to the problems.

• The data displayed within the table are combined within the rows and columns.

• The assignment table is a table which displays the data in relation to the problems.

• These data reflect what we call their respective "consequences."

What is a balanced assignment problem?

• A given assignment problem is considered to be "balanced" if the supply and demand are not equal to one another.

• A given assignment problem is considered to be "balanced" if the number of rows are equal to the number of columns.

• A given assignment problem is considered to be "balanced" if the number of rows are not equal to the number of columns.

• A given assignment problem is considered to be "balanced" if the supply and demand are equal to one another.

If there are 5 machines in a given assignment problem, how many people must be assigned per machine?

• 2

• 3

• 1

• 5

If there are 5 tasks and 4 workers, there would be a need to include a:

• Dummy task

• Dummy cost

• Dummy contract

• Dummy worker

Which of the following is the method used in solving assignment problems?

• North-West Corner Rule

• Hungarian Method

• Vogel's Approximation Method

• Corner-Point Maximization Method

Which of the following is NOT a step in the Hungarian Method process?

• Identify the feasible region of the assignment problem.

• Identify the largest value or number present within the original cost table.

• Revise present cost table.

• Find opportunity cost table.

To consider a solution in the assignment problem as the optimal one, which of the following conditions must be satisfied:

• The lines drawn to cover the zeroes must be less than the number of rows or columns.

• The lines drawn to cover the zeroes must be more than the number of rows or columns.

• There are at least two zeroes per row.

• The lines drawn to cover the zeroes must be equal to either the number of rows or columns.