Assignment problems solved previously by linear programming techniques are also examples of
A)pure-integer programming problems.
B)mixed-integer programming problems.
C)zero-one integer programming problems.
D)goal programming problems.
E)nonlinear programming problems.

Question

Quizplus · Accepted Answer

Assignment problems involve assigning tasks or jobs to resources in the most efficient manner, subject to various constraints. In zero-one integer programming problems, the decision variables can only take on binary values of either 0 or 1, which makes it suitable for modeling assignment problems. Linear programming techniques can be used to solve zero-one integer programming problems. Therefore, option C is the best choice.

Assignment Problems Solved Previously by Linear Programming Techniques Are Also