Linear programming is a single goal programming method, the goal function get the maximum or minimum on the basis of limit condition.
线性规划是一种单目标规划,根据有关的约束条件得出目标函数的最大值或最小值。
In this paper, an area formula of polygon of inscribed or circumscribed ellipse is presented and the condition that the area reaches maximum value or minimum value is discussed.
提出了椭园内接或外切多边形面积公式,并讨论了其面积达到最大值与最小值的条件。
应用推荐