也就是说,如果你可以解出来或者去除掉这些变量的点,就是临界点,当你有这样的问题要解决的时候,我们找到临界点了,它们一定是最大值点或者最小值点吗?
That means if you were able to solve and eliminate the variable that would be a critical point. When you have the same problem, as we have critical points, are they maxima or minima?
当第一次在最大值和我们差距之间选择时,把价值最大化,我们会得到资本,这不会变。
When first choose between maximum of our gap x, maximize the value of the cashiers, and we will take the cashiers, that will not change.
为简单起见,我们只说我们的任务是报告每个文件的MDU最大值,当然还有其它东西(实际的处理远比这个要复杂)。
For the sake of simplicity, lets just say that, amongst other things, our task was to report the maximum MDU found for each file (the actual processing is far more complicated than this).
And now we want to find the subset of a that has the maximum value, subject to the weight constraint.
会有一个值与其对应,现在我们想要找出满足,重量约束条件的a的最大值子集。
So I differentiated this object, this is my first derivative and I set it equal to 0 Now in a second I'm going to work with that, but I want to make sure i'm going to find a maximum and not a minimum, so how do I make sure I'm finding a maximum and not a minimum?
这样我就对它求出导数了,这是一阶导数,令它等于0,一会我们就要计算了,但我先确定一下是最大值还是最小值,我怎么确定是最大值还是最小值呢
So, that's sort of the mathematically how we get to a, but we can also just look at the graph here, because every time we go one wavelength we can see that we're back in a maximum.
这是就我们得到a的数学,办法,但我们可以直接,从图上看,因为每次我们,经过一个波长,都回到一个最大值。
应用推荐