How can ı solve this constraint optimization problem?
显示 更早的评论
回答(3 个)
Bruno Luong
2020-8-1
Hint: you should find
x=y=1
Star Strider
2020-8-1
1 个投票
I get the feeling that this is likely homework.
It would likely be easiest to use the fmincon function, although there are several functions that could do what you want. Note that the optimisation functions minimise the function they are given, so to maximise it, calculate the negative of the function you supply to fmincon.
John D'Errico
2020-8-1
0 个投票
Many things you can do, but since this is your homework, and there are already answrs posted, I'll just suggest a couple of things. Why not plot it? Look at the surface. Look at contours of the function on that domain.
Other things. You could differentiate it. Is there a zero of the gradient vector in that region? Is that at a maximum or minimum?
You could use optimization tools. FMINCON comes to mind. Or GA, or any of a number of tools.
5 个评论
Sinem Senel
2020-8-2
Bruno Luong
2020-8-2
编辑:Bruno Luong
2020-8-2
Yes because they are designed to handle all kinds of constraints. You don't need those constraints that your problem doesn' have, you don't have to set them. Usually that just meant to put an empty bracket '[]' in the corresponding input argument.
And I can find an example similar to your problem, right in the doc page of fmincon, after expanding the section "Minimize with Bound Constraints".
Sinem Senel
2020-8-2
Bruno Luong
2020-8-2
编辑:Bruno Luong
2020-8-2
x0 must be provided base on what a priori your knowledge of where the soluion would be (yeah you definitvely need to read about optimization tools). In this example I direct to you, they select simply as
0.5*(lb+ub)
which is the middle point of the box, heuristically chosen.
Sinem Senel
2020-8-2
类别
在 帮助中心 和 File Exchange 中查找有关 Choose a Solver 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
