linear programming optimization equality constraints

3 次查看(过去 30 天)
hello, i am trying to do linear programming. and i am trying to find the minimum of my objective function.
i have attached the code. and my problem statement is also attached. i keep getting error for my equality constraints i tried every possible way known to me to solve. still couldn't fix it if anyone could suggest a way, it would be really helpful thank you
  8 个评论
Matt J
Matt J 2018-2-14
编辑:Matt J 2018-2-14
Well, I need the X values which will make my pv+pw-L=0...
There are no X values appearing anymore in the expression pv+pw-L. Are we still talking about pv*x(1)+pw*x(2)-L=0?
Similarly, is the objective still f(x) = pv*x(1)+pw*x(2) ?

请先登录,再进行评论。

采纳的回答

Matt J
Matt J 2018-2-14
编辑:Matt J 2018-2-14
for that that L I need values for x(1) and x(2)...such that pv*x(1)+pw*x(2)-L=0 or atleast close to Zero
The above is a a version of what you said here with corrections added by me based on your later comments.
If the whole point is really to minimize |pv*x(1)+pw*x(2)-L| subject to bounds on x, then you should really be using lsqlin:
N=length(pv);
clear x
for i=N:-1:1
f=[pv(i) pw(i)];
[x{i} fval{i}]=lsqlin(f,l(i),[],[],[],[], [0.5,0.5],[2.5,2]);
end
  3 个评论
anu vru
anu vru 2018-2-14
"the trust region reflective algorithm requires at least as many equations as variables" It is showing this warning... Also how is using lsqlin better than linprog?
Matt J
Matt J 2018-2-14
编辑:Matt J 2018-2-14
yes its working now
If so, please Accept-click the answer to certify that the question has been addressed.
The set of all possible solutions will typically be an infinite set of points satisfying the inequalities,
L-optimalValue <= pv*x1+pw*x2 <= L+optimalValue
lbv<= x(1) <=ubv
lbw<= x(2) <=ubw
You can find the vertices of this region using this package.

请先登录,再进行评论。

更多回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Linear Least Squares 的更多信息

Community Treasure Hunt

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

Start Hunting!

Translated by