论文部分内容阅读
线性规划中的最值问题就是讨论二元一次不等式在线性条件约束下求线性目标函数的最大值和最小值问题,一般都是以选择题和填空题的形式
The problem of the maximum value in linear programming is to discuss the problem of finding the maximum and minimum values of the linear objective function under the condition of linear constraints, which is usually in the form of multiple choice questions and blank filling questions.