How to solve with constraints

3 次查看(过去 30 天)
I have
vcuaamo = 13.58823529;
sjuaamo = -4.470588235;
vcuhome = 19.125;
sjuhome = -2.111111111;
vcuaway = 8.666666667;
sjuaway = -7.125;
vculast7 = 15.57142857;
wjulast7 = 2.714285714;
vcuprepoints = 71.9;
sjuprepoints = 65.7;
a = 0.35, b = 0.25, c = 0.2, d = 0.2;
one = a+b+c+d;
one = 1;
I want to find the way this equation equals 12, by changing a, b, c, d. There are some constraints being a>b,c,d and c>b,d, and that a+b+c+d=1, also a,b,c,d > 0
12 == (vcuaamo-sjuaamo)*a+(vcuhome-sjuaway)*b+(vculast7-sjulast7)*c+(vcuprepoints-sjuprepoints)*d
  2 个评论
Walter Roberson
Walter Roberson 2019-3-10
There are an infinite number of solutions, especially once you realize that any of b, c, or d can be negative.

请先登录,再进行评论。

回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Nonlinear Optimization 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by