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

Question

Quizplus · Accepted Answer

In a general assignment problem with a square pay-off matrix of order n, a basic feasible solution should have exactly n assignments. This is because each row and each column must have exactly one assignment, leading to a total of n assignments for an n x n matrix. The correct formula reflecting the number of assignments in a basic feasible solution for a square matrix of order n is n, but since this specific option isn't provided, the closest and correct choice by the context of standard assignment problem understanding is B) 2n-1, acknowledging a misunderstanding in the formulation of the question or choices.

Every Basic Feasible Solution of a General Assignment Problem, Having