the assignment problem mcq

View all MCQs in

No comments yet

Related MCQs

• An assignment problem is considered as a particular case of a transportation problem because
• Maximization assignment problem is transformed into a minimization problem by
• An assignment problem is a special case of transportation problem, where
• Which of the following is used to come up with a solution to the assignment problem?
• Which method usually gives a very good solution to the assignment problem?
• In the general linear programming model of the assignment problem,
• Which of the following is not true regarding an LP model of the assignment problem? ]
• The assignment problem constraint x31 + x32 + x33 + x34 ≤ 2 means
• The assignment problem is a special case of the
• In an assignment problem,

The assignment problem

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

Answer: Option D

Solution(By Examveda Team)

This Question Belongs to Management >> Operations Research

Join The Discussion

Related Questions on Operations Research

The use of decision models.

A. Is possible when the variables value is known

B. Reduces the scope of judgement & intuition known with certainty in decision-making

C. Require the use of computer software

D. None of the above

Every mathematical model.

A. Must be deterministic

B. Requires computer aid for its solution

C. Represents data in numerical form

A physical model is example of.

A. An iconic model

B. An analogue model

C. A verbal model

D. A mathematical model

The qualitative approach to decision analysis relies on.

A. Experience

B. Judgement

C. Intuition

More Related Questions on Operations Research

Read More: MCQ Type Questions and Answers

•   Arithmetic Ability
•   Competitive Reasoning
•   Competitive English
•   Data Interpretation
•   General Knowledge
•   State GK
•   History
•   Geography
•   Current Affairs
•   Banking Awareness
•   Computer Fundamentals
•   Networking
•   C Program
•   Java Program
•   Database
•   HTML
•   Javascript
•   Computer Science
•   Electronics and Communications Engineering
•   Electrical Engineering
•   Mechanical Engineering
•   Civil Engineering
•   Chemical Engineering
•   Automobile Engineering
•   Biotechnology Engineering
•   Mining Engineering
•   Commerce
•   Management
•   Philosophy
•   Agriculture
•   Sociology
•   Political Science
•   Pharmacy

• High School
• You don't have any recent items yet.
• You don't have any courses yet.
• You don't have any books yet.
• You don't have any Studylists yet.
• Information

MCQ Assignment - Notes

Decision science (mba 302), savitribai phule pune university.

Recommended for you

Students also viewed

• Ethos & Ethics - Information
• Photocopy of a university exam
• Difference between fera and fema upsc notes 24
• 2 years MCA 2020 pattern R syllabus 10
• DS MCQ - ds mcq

Related documents

• MCQ FOR DS - ds mcq
• 8 Money Hacks - this is 8 maony hack by rupesh chavan
• MCQ Decision theory - Notes
• Decision Science - ......
• Doc Scanner 1 Aug 2024 15-07

Related Studylists

Preview text.

Chapter 1: Assignment Problem

Multiple Choice Questions (MCQ)

The application of assignment problems is to obtain _________. a. only minimum cost. b. only maximum profit. c. minimum cost or maximum profit. d. assign the jobs.

The assignment problem is said to be unbalanced if _________. a. number of rows is greater than number of columns. b. number of rows is lesser than number of columns. c. number of rows is equal to number of columns. d. both 1 and 2.

The assignment problem is said to be balanced if _________. a. number of rows is greater than number of columns. b. number of rows is lesser than number of columns. c. number of rows is equal to number of columns. d. if the entry of row is zero.

The assignment problem is said to be balanced if it is _________. a. square matrix. b. rectangular matrix. c. unit matrix. d. triangular matrix.

In assignment problem if number of rows is greater than column then _________. a. dummy column is added. b. dummy row added. c. row with cost 1 is added. d. column with cost 1 is added.

In assignment problem if number of column is greater than row then _________. a. dummy column is added. b. dummy row added. c. row with cost 1 is added. d. column with cost 1 is added.

An optimal assignment requires that the maximum number of lines which can be drawn through squares with zero opportunity cost be equal to the number of______. a. rows or coloumns. b. rows and coloumns. c. rows+columns- 1. d. rows-columns.

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. reduce total cost of assignment.

Maximization assignment problem is transformed into a minimization problem by_________. a. adding each entry in a column from the maximum value in that column. b. subtracting each entry in a column from the maximum value in that column. c. subtracting each entry in the table from the maximum value in that table. d. adding each entry in the table from the maximum value in that table.

The assignment problem is a special case of transportation problem in which ______. a. number of origins equals the number of destinations. b. number of origins are less than the number of destinations. c. number of origins are greater than the number of destinations. d. number of origins are greater than or equal to the number of destinations.

Identify the correct statement. a. an assignment problem may require the introduction of both dummy row and dummy column. b. an assignment problem with m rows and n columns will involves a total of m x n possible assignments. c. an unbalanced assignment is one where the number of rows is more than, or less than,the number of columns. d. balancing any unbalanced assignment problem involves adding one dummy row /column.

The minimum number of lines covering all zeros in a reduced cost matrix of order n can be _____. a. at the most n. b. at the least n. c. n – 1. d. n + 1.

In an assignment problem involving 5 workers and 5 jobs, total number of assignments possible are _______. a. 5!. b. 10. c. 25. d. 5.

In marking assignments, which of the following should be preferred? a. Only row having single zero. b. Only column having single zero. c. Only row/column having single zero. d. Column having more than one zero.

The Hungarian method used for finding the solution of the assignment problem is also called ___________. a. reduced matrix method. b. matrix minima method. c. modi method. d. simplex method.

The assignment algorithm was developed by ____________. a. Modi. b. Kuhn. c. Hungarian. d. Vogel’s.

In an assignment problem,

a. one agent can do parts of several tasks b. one task can be done by several agents c. each agent is assigned to its own best task d. none of the above

• 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

• An optimal assignment requires that the maximum number of lines that can be drawn through

sequares with zero opportunity cost be equal to the number of a. Rows or columns b. Rows and columns c. Rows + column - d. None of the above

• 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

• 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

• Maximization problem is transformed into a minimization problem by

a. Adding each entry in a column from the maximum value in that column b. Subtracting each entry in a column from the maximum value in that column c. Subtracting each entry in the table from the maximum value in that table d. Any one of the above

• If there were n workers and n jobs there would be

a. n! solutions b. (n-1)! Solutions

c. (n!)ⁿ solutions

d. n solutions e.

• An assignment problem can be solved by

a. Simplex method b. Transportation method c. Both (a) and (b) d. None of the above

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

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 d. All of the above

• Every basic feasible solution of a general assignment problem having a square pay-off matrix of

order, n should have assignments equal to a. 2n + 1 b. 2n – 1 c. m + n – 1 d. m + n

• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy

allocations need to be added are a. n b. 2n c. n – 1 d. 2n – 1

• The Hungarian method for solving an assignment problem can also be used to solve

a. A transportation problem b. A travelling salesman problem c. Both (a) and (b) d. Only (b)

An optimal solution of an assignment problem can be obtained only if a. Each row and column has only one zero element b. Each row and column has at least one zero element c. The data are arrangement in a square matrix d. None of the above

Flood’s technique of solving an assignment matrix uses the concept of

a. Maximum cost

• Multiple Choice

Course : Decision Science (MBA 302)

University : savitribai phule pune university, this is a preview.

Access to all documents

Get Unlimited Downloads

Improve your grades

Share your documents to unlock

Get 30 days of free Premium

Why is this page out of focus?

Have an account?

Suggestions for you See more

Arsenal Quiz

More and less, prepositions, ordinal numbers, kindergarten math, odd or even.

Transportation and Assignment Problem

Mathematics.

5 questions

Introducing new   Paper mode

No student devices needed.   Know more

The north- west corner rule is used to find

Initial feasible solution

An optimum solution

Non- optimum solution

None of these

An assignment problem is a

Non- integer programming problem

Integer programming problem

Transportation problem

Which is true for assignment problem?

The number of rows equals the number of columns

All circled values in a stone are one

All rim requirements are one

All are true

In a balanced transportation problem with m origins and n destinations the number of linearly independent constraints is

In an unbalanced transportation problem with m- sources and n- destinations the number of basic variables is

Explore all questions with a free account

Continue with email

Continue with phone