Solving compound linear optimization problem

2 views (last 30 days)
carlos g
carlos g on 29 Mar 2019
Answered: Torsten on 1 Apr 2019
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?

Answers (2)

Catalytic on 29 Mar 2019
I've never heard of a compound optimization problem but maybe this will help

Torsten on 1 Apr 2019
Look up

Community Treasure Hunt

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

Start Hunting!