An assignment problem is a special type of linear programming problem. Its primary objective is to assign a set of resources (e.g., persons, machines) to a set of tasks (e.g., jobs) on a one-to-one basis. The goal is to find the assignment that optimizes a given objective function, which is most commonly to minimize the total cost or time. While maximization problems (e.g., maximizing profit) also exist, the standard and most fundamental objective is minimization. Option (b) is the most complete and accurate description of the standard assignment problem.