Skip to main content
 首页 » 编程设计

python之优化python中的非线性函数

2025年01月19日9sky-heaven

我在 python 中有一个函数,如下所示:

import numpy as np     
 
def fun(Gp,Ra,Mr,Pot,Sp,Mc,Keep): 
   if(Keep==True): 
     return(Pot*np.tanh((Gp+Ra+Mr+ Mc)*Sp )) 

假设以下数据:

   import pandas as pd 
dt_org = pd.DataFrame({"RA": [0.5, 0.8, 0.9], 
                   "MR": [0.97, 0.95, 0.99], 
                   "POT": [0.25, 0.12, 0.05], 
                   "SP": [0.25, 0.12, 0.15], 
                   "MC": [50, 75, 100], 
                   "COUNTRY": ["GB", "IR", "GR"] 
                   }) 

我总共有 100 GP,我想分配所有的 为了最大化objective_function:

在3个元素所有都是正的限制下

根据 this发布 scipy.optimize 是可行的方法,但我很困惑如何将问题写下来

更新:我的尝试

from scipy.optimize import minimize 
 
y = {'A': {'RA': 0.5, 'MR': 0.97, 'POT': 0.25, 'SP': 0.25, 'MC': MC_1, 'keep': True}, 
     'B': {'RA': 0.8, 'MR': 0.95, 'POT': 0.12, 'SP': 0.12, 'MC': MC_2, 'keep': True}, 
         'C': {'RA': 0.9, 'MR': 0.99, 'POT': 0.05, 'SP': 0.15, 'MC': MC_3, 'keep': True}} 
 
def objective_function(x): 
                return( 
                     -(fun(x[0], Ra=y['A']['RA'], Mr=y['A']['MR'], 
                                             Pot=y['A']['POT'], Sp=y['A']['SP'], 
                                             Mc=y['A']['MC'], Keep=y['A']['keep']) + 
                       fun(x[1], Ra=y['B']['RA'], Mr=y['B']['MR'], 
                                             Pot=y['B']['POT'], Sp=y['B']['SP'], 
                                             Mc=y['B']['MC'], Keep=y['B']['keep']) + 
                       fun(x[2], Ra=y['C']['RA'], Mr=y['C']['MR'], 
                                             Pot=y['C']['POT'], Sp=y['C']['SP'], 
                                             Mc=y['C']['MC'], Keep=y['C']['keep'])) 
                ) 
 
cons = ({'type': 'ineq', 'fun': lambda x:  x[0] + x[1] + x[2] - 100}) 
 
bnds = ((0, None), (0, None), (0, None)) 
 
minimize(objective_function, x0=[1,1,1],   args=y, method='SLSQP', bounds=bnds, 
             constraints=cons) 

现在的问题是我收到错误 ValueError: Objective function must return a scalar,而 fun 函数的输出是一个标量

更新 2(@Cleb 评论后) 所以现在我改变了功能:

def objective_function(x,y): 
 
                temp =   -(fun(x[0], Ra=y['A']['RA'], Mr=y['A']['MR'], 
                                             Pot=y['A']['POT'], Sp=y['A']['SP'], 
                                             Mc=y['A']['MC'], Keep=y['A']['keep']) + 
                       fun(x[1], Ra=y['B']['RA'], Mr=y['B']['MR'], 
                                             Pot=y['B']['POT'], Sp=y['B']['SP'], 
                                             Mc=y['B']['MC'], Keep=y['B']['keep']) + 
                       fun(x[2], Ra=y['C']['RA'], Mr=y['C']['MR'], 
                                             Pot=y['C']['POT'], Sp=y['C']['SP'], 
                                             Mc=y['C']['MC'], Keep=y['C']['keep'])) 
 
 
                print("GP for the 1st: " + str(x[0])) 
                print("GP for the 2nd: " + str(x[1])) 
                print("GP for the 3rd: " + str(x[2])) 
        return(temp) 
 
cons = ({'type': 'ineq', 'fun': lambda x:  x[0] + x[1] + x[2] - 100}) 
 
bnds = ((0, None), (0, None), (0, None)) 

现在有两个问题: 1. x[0],x[1],x[2] 的值非常接近

  1. x[0],x[1],x[2] 的总和超过 100

请您参考如下方法:

关于您的目标函数存在一个普遍问题,它解释了为什么您获得的值彼此非常接近;下面讨论。

如果我们首先从技术方面来看,下面的方法对我来说很好:

import numpy as np 
from scipy.optimize import minimize 
 
 
def func(Gp, Ra, Mr, Pot, Sp, Mc, Keep): 
    if Keep: 
        return Pot * np.tanh((Gp + Ra + Mr + Mc) * Sp) 
 
 
def objective_function(x, y): 
 
    temp = -(func(x[0], Ra=y['A']['RA'], Mr=y['A']['MR'], Pot=y['A']['POT'], Sp=y['A']['SP'], Mc=y['A']['MC'], Keep=y['A']['keep']) + 
             func(x[1], Ra=y['B']['RA'], Mr=y['B']['MR'], Pot=y['B']['POT'], Sp=y['B']['SP'], Mc=y['B']['MC'], Keep=y['B']['keep']) + 
             func(x[2], Ra=y['C']['RA'], Mr=y['C']['MR'], Pot=y['C']['POT'], Sp=y['C']['SP'], Mc=y['C']['MC'], Keep=y['C']['keep'])) 
 
    return temp 
 
 
y = {'A': {'RA': 0.5, 'MR': 0.97, 'POT': 0.25, 'SP': 0.25, 'MC': 50., 'keep': True}, 
     'B': {'RA': 0.8, 'MR': 0.95, 'POT': 0.12, 'SP': 0.12, 'MC': 75., 'keep': True}, 
     'C': {'RA': 0.9, 'MR': 0.99, 'POT': 0.05, 'SP': 0.15, 'MC': 100., 'keep': True}} 
 
cons = ({'type': 'ineq', 'fun': lambda x:  x[0] + x[1] + x[2] - 100.}) 
 
bnds = ((0., None), (0., None), (0., None)) 
 
print(minimize(objective_function, x0=np.array([1., 1., 1.]), args=y, method='SLSQP', bounds=bnds, constraints=cons)) 

这将打印

    fun: -0.4199999999991943 
     jac: array([ 0.,  0.,  0.]) 
 message: 'Optimization terminated successfully.' 
    nfev: 6 
     nit: 1 
    njev: 1 
  status: 0 
 success: True 
       x: array([ 33.33333333,  33.33333333,  33.33333333]) 

如您所见,x 的总和正好等于 100。

如果您现在将 bnds 更改为例如

bnds = ((40., 50), (0., None), (0., None)) 

那么结果就是

     fun: -0.419999999998207 
     jac: array([ 0.,  0.,  0.]) 
 message: 'Optimization terminated successfully.' 
    nfev: 6 
     nit: 1 
    njev: 1 
  status: 0 
 success: True 
       x: array([ 40.,  30.,  30.]) 

同样,约束条件得到满足。

也可以看出客观值(value)是一样的。这似乎是因为 Mc 和 Gp 非常大,因此,np.tanh 将始终只返回 1.0 。这意味着对于 y 中的所有三个词典,您始终只从 func 返回值 Pot。如果把对应的三个值加起来

0.25 + 0.12 + 0.05 

您确实得到了由优化决定的值 0.42。