论文部分内容阅读
线性规划解决的是求二元一次函数最值的问题,制约这一问题的因素有线性目标函数和线性约束条件.本文讲:当保持线性约束条件不变,而目标函数变为向量形式的情形.
Linear programming solves the problem of finding the maximum value of a bivariate first order function. The factors constraining this problem are the linear objective function and the linear constraint conditions. This article states: When the linear constraint condition remains unchanged, and the objective function becomes vector form .