论文部分内容阅读
整点的最优解是线性规划中经常遇到的问题,如房间的分配问题、汽车的调运安排问题、材料的截取问题等等.而可行域中最优解又不是整数时,就需要考虑相应的方法和技巧.一、逐点验证法当可行域是有限区域且整点个数比较少,或最优解涉及的整点较少时,可将整点的坐标代入目标函数求值,经过比较求出最优解.例1(2010年高考广东题)某营养师要为某个儿童预订午餐和晚餐.已知一个单位的午餐含12个单位的碳水化合物,6个单位的
The optimal solution of the whole point is often encountered in linear programming, such as room allocation problem, car scheduling problem, material interception problem, etc. The optimal solution in the feasible region is not an integer, you need to consider Corresponding methods and techniques First, the point-by-point verification method When the feasible region is a finite area and the number of whole points is relatively small, or the whole point involved in the optimal solution is small, the coordinates of the whole point can be substituted into the objective function for evaluation, After comparison to find the optimal solution.Example 1 (2010 college entrance examinationGuangdong title) a dietitian to book a lunch and dinner for a child.It is known that a unit of lunch contains 12 units of carbohydrates, 6 units of