Paper Tayyari

Lecture 36: Assignment Problems

MCQs, short and long questions from lecture 36.Lecture 36 ki MCQs, short aur long sawal.

5 MCQs · 5 MCQs from past papers5 MCQs · 5 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/5
– correctsahi
1.
★ Final term 2012

The cost matrix in assignment problem is always ___ (screen text: 'is always diagonal matrix')

  1. Asquare matrix
  2. Bidentity matrix
  3. Czero matrix

An assignment problem needs equal rows and columns (adding dummies if needed), so its cost matrix is square.

2.
★ Final term 2012

Which of the following binary operation in assignment problem among all the elements in the given profit matrix from the highest element in the matrix

  1. ASubtraction
  2. BDivision
  3. CMultiplication
  4. DAddition

A maximization assignment is converted by subtracting every profit from the largest element.

3.
★ Final term paper (screens, paper 2)

Transportation technique or the simplex method cannot be used to solve the assignment problem because of

  1. ADegeneracy
  2. BInvolvement of dummy activities
  3. CLooping among the entries of assignment matrix
  4. DInequilibrium between demand and supply

An n×n assignment has only n positive allocations instead of 2n-1, so it is highly degenerate.

4.
★ Final term paper (screens, paper 2)

In assignment problem, each job requires exactly one resource.

  1. ATrue
  2. BFalse
  3. CMay not be true

Assignment is one-to-one: each job gets exactly one resource and each resource one job.

5.
★ Final term Fall 2006

In assignment problem each job requires

  1. AExactly one resource
  2. BAt least one resource
  3. CAt most one resource

Each job is assigned to exactly one resource and each resource to exactly one job.