论文部分内容阅读
线性规划中的最值问题就是讨论二元一次不等式在线性条件约束下求线性目标函数的最大值和最小值问题,一般都是以选择题和填空题的形式出现,怎样求解这类问题呢?主要有两种策略,请看下面的例子:
The problem of the maximum value in linear programming is to discuss the problem of finding the maximum and minimum of the linear objective function under the constraints of linear conditions. It is usually in the form of multiple choice questions and blank filling questions. How to solve such problems? There are two main strategies. See the following example: