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.

Question

Quizplus · Accepted Answer

Assignment problems involve assigning tasks to individuals or machines. The decision variable is often binary (0 or 1) representing whether a certain task is assigned to a certain person/machine or not. This is known as zero-one integer programming. Linear programming can be used to solve such problems, but it requires the addition of specific constraints to enforce the binary nature of the decision variables. Pure-integer programming involves decision variables that are integer but not necessarily binary, while mixed-integer programming involves decision variables that may be a mix of continuous and integer values. Goal programming involves multiple objectives that need to be optimized simultaneously.

Assignment Problems Solved Previously by Linear Programming Techniques Are Also