Q1. In an assignment problem, if all cᵢⱼ ≥ 0, then xᵢⱼ = Xᵢⱼ will be an optimal solution where
Explanation
In a minimization assignment problem with all cᵢⱼ ≥ 0, the objective value cannot be negative. If a feasible assignment X gives ΣᵢΣⱼ cᵢⱼXᵢⱼ = 0, it has attained the least possible objective value. Therefore xᵢⱼ = Xᵢⱼ is optimal, so option D is correct.
