(1) The discovery of the simplex method in 1947 was the beginning of management science as a discipline.
(2) When formulating a linear programming problem on a spreadsheet, the Excel equation for each output cell can typically be expressed as a SUMPRODUCT function.
(3) It is the nature of the application that determines the classification of the resulting linear programming formulation.
(4) When dealing with huge real problems, there is no such thing as the perfectly correct linear programming model for the problem.
(5) The purpose of a linear programming study is to help guide management's final decision by providing insights.
(6) Changing the objective function coefficients may or may not change the optimal solution, but it will always change the value of the objective function.
(7) It is possible to have a constraint in a BIP that excludes the possibility of choosing none of the alternatives available.
(8) The constraint x1 ≤ x2 in a BIP problem means that alternative 2 cannot be selected unless alternative 1 is also selected.
(9) The goal of queuing analysis is to minimize customer waiting lines.
(10) Multiple-server queuing systems can perform satisfactorily with somewhat higher utilization factors than can single-server queuing systems.
