GEKKO优化函数没有给出解决方案

Question

我正试图找出这个问题的整数解的列表。我试图最大化函数get_sharpe_ratio。当我运行程序时，结果总是零

优化函数位于函数calc_sharp_ratio内

我哪里做错了？我怎样才能得到我想要的解决方案

import numpy as np

from gekko import GEKKO

class WeightOptimalSolver:

def __init__(self, stocks, total_money, rf):

    self._stocks = stocks
    self._rf = rf/252
    self._total_money = total_money

def get_sharpe_ratio(self, hands):

    shares = []

    # Get shares
    for h in hands:
        shares.append(h * 100)

    # Get weigths
    required_money = 0

    for s in range(0,len(shares)):
        required_money += shares[s] * float(self._stocks[s].get_price())

    weights = []

    for s in range(0,len(shares)):
        weight = shares[s] * float(self._stocks[s].get_price()) / required_money
        weights.append(weight)

    Er = 0
    sd = 0

    for s in range(0,len(self._stocks)):
        Er += float(self._stocks[s].get_Er()) * weights[s]
        sd += float(self._stocks[s].get_sd()) * weights[s]

    inverse_sharpe_ratio =  -1 * ((Er - self._rf)/sd)

    return inverse_sharpe_ratio

def get_required_money(self, hands):

    required_money = 0

    for h in range(0,len(hands)):
        required_money += hands[h] * 100 * float(self._stocks[h].get_price())

    return required_money


def calc_sharp_ratio(self):

    m = GEKKO(remote = True)

    hands = [m.Var(integer = True, ub = 0) for h in range(len(self._stocks))]

    m.Equation(self.get_required_money(hands) >= -1 * self._total_money)
    m.Obj(self.get_sharpe_ratio(hands))
    m.options.SOLVER = 1
    m.solve()

    return hands

if __name__ == '__main__':

    import Stocks
    import datetime
    import WeightOptimalSolver

    Today = datetime.datetime.today()
    dateToday = Today.strftime('%Y-%m-%d')

    stocks = Stocks.Stocks('Data/' + dateToday + 'hedgeA' + '.csv').get_stocks()

    wos = WeightOptimalSolver.WeightOptimalSolver(stocks[0:2], 15000, 0.03)
    hands = wos.calc_sharp_ratio()

    print(hands)

结果是：

apm 70.191.46.236_gk_model0 <br><pre> ----------------------------------------------------------------
 APMonitor, Version 1.0.1
 APMonitor Optimization Suite
 ----------------------------------------------------------------
 
 
 Warning: there is insufficient data in CSV file 70.191.46.236_gk_model0.csv
 
 --------- APM Model Size ------------
 Each time step contains
   Objects      :            0
   Constants    :            0
   Variables    :            3
   Intermediates:            0
   Connections  :            0
   Equations    :            2
   Residuals    :            2
 
 Number of state variables:              3
 Number of total equations: -            1
 Number of slack variables: -            1
 ---------------------------------------
 Degrees of freedom       :              1
 
 ----------------------------------------------
 Steady State Optimization with APOPT Solver
 ----------------------------------------------
Iter:     1 I:  0 Tm:      0.00 NLPi:    2 Dpth:    0 Lvs:    0 Obj:       NaN Gap:  0.00E+00
 Successful solution
 
 ---------------------------------------------------
 Solver         :  APOPT (v1.0)
 Solution time  :   1.279999999678694E-002 sec
 Objective      :                      NaN
 Successful solution
 ---------------------------------------------------
 
[[0.0], [0.0]]

Answer 1

所有gekko问题定义为静态方程，然后编译并发送给解算器。似乎每次调用函数时，方程的定义都会发生变化。解决方案是使用Scipy.optimize.minimize等解算器作为shown here或者使用Gekko函数来构建模型Scipy.optimize.minimize是一个非线性规划求解器，因此解决方案可能包括分数hands。下面是一个使用Gekko的混合整数解决方案的示例

from gekko import GEKKO
m = GEKKO() # create GEKKO model
# create integer variables
x1 = m.Var(integer=True,lb=-5,ub=10) 
x2 = m.Var(integer=True,lb=-1,ub=2)
m.Minimize(4*x1**2-4*x2*x1**2+x2**2+x1**2-x1+1)
m.options.SOLVER = 1 # APOPT solver
m.solve()
print('x1: ' + str(x1.value[0]))
print('x2: ' + str(x2.value[0]))

无法测试您发布的问题，因为缺少包Stocks和WeightOptimalSolver以及数据文件'Data/' + dateToday + 'hedgeA' + '.csv'。如果可能的话，试着分享一个可以重现的问题，以便将来提问