linear inequality constrains based on absolute values

Question

D D 2022-10-6

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1818575-linear-inequality-constrains-based-on-absolute-values

评论： Walter Roberson 2022-10-7

采纳的回答： Matt J

Please help me to define the inequality constrains for quadprog in the below scenario

x+y <= 0.1*abs(x)

x+y >= -0.1*abs(x)

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Matt J 2022-10-6

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1818575-linear-inequality-constrains-based-on-absolute-values#answer_1067835

编辑：Matt J 2022-10-6

The constraints correspond to a non-convex region in

(as Walter's second plot shows). You would have to break it into two regions and optimize over each one separately:

Region 1:

x<=0

x+y <= 0.1*(-x)

x+y >= -0.1*(-x)

Region 2:

x>=0

x+y <= 0.1*(x)

x+y >= -0.1*(x)

3 个评论
显示 1更早的评论隐藏 1更早的评论

Torsten 2022-10-7

The one that gives the lowest value of the objective, I guess.

help min

Walter Roberson 2022-10-7

There is no point which is not in one of the regions or the other, so solving separately and looking for the best between the two is going to get you the same result as if you had no constraint.

It would make more sense if the conditions were "and" and you processed the intersection of the constraints in two pieces, one for negative x and the other for non-negative x, and took the best between the two of those.

请先登录，再进行评论。