How to solve with constraints
조회 수: 2 (최근 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
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 Center 및 File Exchange에서 Nonlinear Optimization에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!