exhaustive search algorithm problem
조회 수: 5 (최근 30일)
이전 댓글 표시
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 = []
댓글 수: 0
답변 (1개)
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.
댓글 수: 0
참고 항목
카테고리
Help Center 및 File Exchange에서 Problem-Based Optimization Setup에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!