4

1. A linear programming problem where the objective is to match employees to an equal number of tasks at a minimum costs is called:
2. A resource-allocation problem
3. A matching problem
4. An assignment problem
5. A cost-benefit tradeoff problem
6. None of the above

QUESTION 6

1. Which of the following is NOT true about linear programming problems:
2. Linear programming problems can be formulated both algebraically as a mathematical model and on spreadsheets
3. Approximations and simplifying assumptions generally are required to have a workable linear programming model
4. Model formulation should precede problem formulation
5. Choosing the best tradeoff between cost and benefits is a managerial judgment decision
6. None of the above