Which of the following is NOT true about linear programming problems:

Linear programming problems can be formulated both algebraically as a mathematical model and on spreadsheets

A mathematical model will be an exact representation of the real problem

Approximations and simplifying assumptions generally are required to have a workable linear programming model

In the algebraic form of a resource constraint, the coefficient of each decision variable is the resource usage per unit of the corresponding capacity

None of the above