When a maximization assignment problem is converted into a minimization problem, the resulting matrix is called_________a.Cost Matrixb.Profit Matrixc.Regret Matrixd.Dummy Matrix

In an Linear programming problem, the restrictions or limitations under which the objective function is to be optimized are called

If in an assignment problem, the number of rows is not equal to the number of columns, then________a.Problem is degenerateb.Problem is unbalancedc.It is a maximization problemd.Optimal solution is not possible

In a restricted assignment problem, assignment is____________a.Achieved by not assigning a very high cost (say ∞ or M) to the cells where assignments are prohibitedb.Each machine can perform each job but with an equal degree of efficienciesc.Achieved by assigning a very high cost (say ∞ or M) to the cells where assignments are prohibitedd.None of the above

What is the term used to describe a solution to a Linear Programming Problem where the objective function has the maximum possible value?  A. Optimal solution  B. Infeasible solution  C. Unbounded solution  D. Feasible solution

The goal of the assignment problem is to assign each task to the most appropriate worker such that the total resource expenditure to complete all tasks is minimised.a.Trueb.Falsec.Can't sayd.None of these