以下优化问题的解决方案是什么?

时间:2020-04-13 20:30:49

标签: matlab mathematical-optimization convex-optimization

max g(x,y)= x*k+(1-x)*log(1+((x*y)*l)/(1-x))
s.t: 0<=x<=1,0<=y<=1,
where k,l>0. 

保持一个约束固定,函数g(x)/ g(y)是一个凹函数。 Matlab仿真还通过各种k和l对其进行了检查。 g(x,y)的仿真结果也给出了凹函数。存在两个约束时,g(x,y)的最大值是多少?

1 个答案:

答案 0 :(得分:0)

也许您可以像下面那样尝试fmincon

fn = @(v) -(v(1)*k+(1-v(1))*log(1+((v(1)*v(2))*l)/(1-v(1))));
Xopt = fmincon(fn,[0.5,0.5],[],[],[],[],[0;0]+eps,[1;1]-eps);

示例

k = 5;
l = 2;
fn = @(v) -(v(1)*k+(1-v(1))*log(1+((v(1)*v(2))*l)/(1-v(1))));
Xopt = fmincon(fn,[0.5,0.5],[],[],[],[],[0;0]+eps,[1;1]-eps);

这样

>> Xopt
Xopt =

   0.99800
   0.54714