数据、模型与决策(运筹学)课后习题和案例答案017.docVIP

CD Chapter 17Solution Concepts for Linear Programming Review Questions 17.1-1 A corner point is a point that lies at a corner of the feasible region. 17.1-2 The corner point with the best value of the objective function is the optimal solution. 17.1-3 The simplex method has a way of quickly getting to the best corner point and detecting that this point is optimal, so it stops without needing to evaluate the rest of the corner points. 17.1-4 No. It can have one optimal solution, an infinite number of optimal solutions, or no optimal solution. 17.1-5 Yes, and every point of the line segment between these two corner points will be an optimal solution. 17.1-6 The constraints of a linear programming problem can be so restrictive that it is impossible for a solution to satisfy all of the constraints simultaneously. 17.1-7 If some necessary constraint were not included in the linear programming model, it is possible to have no limit on the best objective function value. 17.2-1 The best corner point is always an optimal solution. 17.2-2 The big advantage of searching for an optimal solution simply by finding the best corner point is that it tremendously reduces the number of solutions that need to be considered. 17.2-3 When the simplex method is ready to move from the current corner point to the next one, the adjacent corner points are candidates to be the next one. 17.2-4 If none of the adjacent corner points are better than the current corner point, then the current corner point is an optimal solution. 17.2-5 If the simultaneous solution of a set of constraint boundary equations is feasible then that solution is a corner point. 17.2-6 Two corner points are adjacent to each other if they share all but one of the same constraint boundaries. 17.2-7 The simplex method examines corner points in an order such that each one is adjacent to the preceding one. This greatly streamlines the algebra. 17.2-8 A problem with 20 decision variable and 30 functional constraints might have