论文部分内容阅读
为了求一类二元二次代数式f(x,y)在某二元二次函数g(x,y)=0的条件下的最大值和最小值,我们设p=f(x,y),p便是要求的目标,所以把p称为变量x、y的目标函数。这类目标函数的最值问题,一般都是应用降维法来求解,但其运算量大,过程繁杂,而且容易出错。本文所采用的降次法即先由条件式或目标函数进行适当的恒等变换,再使目标函数降为一次的条件最值问题进行处理,这样将比降维法简
In order to find the maximum and minimum values of a binary quadratic algebraic expression f(x,y) under the condition of a binary quadratic function g(x,y)=0, we set p=f(x,y). ,p is the desired goal, so we call p the objective function of the variables x and y. The most value problem of this type of objective function is generally applied to reduce the dimension method to solve, but its large amount of computation, the process is complex, and error-prone. The degeneracy method used in this paper is first performed by the conditional or objective function with appropriate identity transformation, and then the objective function is reduced to the one-time conditional value problem. This will reduce the dimensionality method.