exhaustive search algorithm problem

1 次查看（过去 30 天）
Nourhan Elsayed
Nourhan Elsayed 2020-10-21
回答： Mario Malic 2020-10-21
hi all
what is the code that find the optimum value between a group of values arranged on an array of size 1x12 that satisfy 2 inequality constraints using exhaustive search method
i want to minimize F(x) using exhaustive search algorithm
x = P_mcr
F = P_mcr * Cost
Array = [3060 3900 4080 5200 5440 4880 6100 7320 8540 9760 3480 4060
]
Cost = [1000 2000 3000 1000 3453 5466 322 6747 7574 3626 7987 3278];
F = P_mcr * Cost
P = [ 9083 4304 3840 4689 3480 2421];
[c, ceq] = constraint(x)
ceq(1) = P - P_mcr * eta_mech
ceq(2) = P_mcr * eta_mech- P - 500
c = []

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

回答（1 个）

Mario Malic
Mario Malic 2020-10-21
Googling the "exhaustive search algorithm", you will see what is it. It looks like you have to generate all x points for which you'll evaluate the objective function and take the one with the minimum objective function.

类别

在 Help Center 和 File Exchange 中查找有关 Direct Search 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by