Chapter 14 CD – Solution Concepts for Linear Programming
True / False Questions
1. The simplex method can only solve problems with up to 100 functional constraints.
2. The simplex method is an algorithm that can be used for solving only large-scale
problems.
3. The data given in the Solver’s sensitivity report are obtained directly from the output of the
simplex method.
4. An optimal solution must lie on the boundary of the feasible region.
5. It is possible in some cases for a point inside the boundary of the feasible region to be an
optimal solution.
6. Most linear programming problems have just one optimal solution.
14-6
34. The theoretical limit on the number of decision variables that can be handled by the
simplex method in a single problem is:
35. If a problem has more than one optimal solution then:
36. If a maximization problem has an objective function of 3x1 + 2x2, which of the following
corner points is the optimal solution?
37. If a maximization problem has an objective function of 3x1 + 10x2, which of the following
corner points is the optimal solution?
