Solving compound linear optimization problem

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?

回答(2 个)

Look up
https://de.mathworks.com/discovery/multiobjective-optimization.html

类别

帮助中心File Exchange 中查找有关 Problem-Based Optimization Setup 的更多信息

提问:

2019-3-29

回答:

2019-4-1

Community Treasure Hunt

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

Start Hunting!

Translated by