y1=(p1-195)*3450.9*(2*(0.1645*832+129.05)/(0.1612*p1+121.61+0.1645*p2+129.05)).^1.6587*exp(-2*(0.1612*p1+121.61)/(0.1612*p1+121.61+0.1645*p2+129.05))/(exp(-2*(0.1612*p1+121.61)/(0.1612*p1+121.61+0.1645*p2+129.05))+exp(-2*(0.1645*p2+129.05)/(0.1612*p1+121.61+0.1645*p2+129.05)));
w1=(p2-372)*3450.9*(2*(0.1645*832+129.05)/(0.1612*p1+121.61+0.1645*p2+129.05)).^1.6587*exp(-2*(0.1645*p2+129.05)/(0.1612*p1+121.61+0.1645*p2+129.05))/(exp(-2*(0.1612*p1+121.61)/(0.1612*p1+121.61+0.1645*p2+129.05))+exp(-2*(0.1645*p2+129.05)/(0.1612*p1+121.61+0.1645*p2+129.05)));
求p1在（195，558），p2在（372，940）范围内，两个函数的最大值，以及相应的p1,p2值，我编出的程序直接显示
Warning: Trust-region-reflective algorithm does not solve this type of problem,
using active-set algorithm. You could also try the interior-point algorithm:
set the Algorithm option to 'interior-point' and rerun. 哪位大牛能不能帮忙编下程序啊，急求啊
扫码加好友，拉您进群
全部版块
我的主页
收藏
