Solving compound linear optimization problem
2 次查看(过去 30 天)
显示 更早的评论
I would like to solve the following compound optimization problem in MATLAB:
min (Ax-a), min (Bx-b), min (Cx-c)
subject to Dx=d and x>=0, where a,b,c,d,A,B,C,D are given.
First of all, I don't know how to set up the above problem, should I write
min(Ax-a)^2+min(Bx-b)^2+min(Cx-c)^2, s.t. Dx=d and x>=0
Is this the best formulation of such problem? The second question is, should I use quadprog or are there other more suitable routines in MATLAB?
0 个评论
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Surrogate Optimization 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!