if you have
- 1,000,000
- then u have a b c d = price = decision variable
- p,q,r,s = amount
then
q <= p/2
in generic form
q- 0.5 p<=0
in function form
F(p,q,r,s) = p*a' +q *b' + r* C' +s *D'
other constraints
1,000,000 - p*a +q *b + r* C +s *D = 0
what is harder in equality and inequality so the answer is equality
the number of optima = optima = data =พหูพจ
เอกพจ= datum = optimum
unimodal one clear optimum
multimodal more than one optima
deceptive false optima
f(x)=sin^4 (5 pi x)
Schwefel's function the answer is near an edge it's have special algorithm to find (search for more information)
Type of an optimization problem
ความเสียงคือความไม่แน่นอน
Uniobjective = one objective
Multiobjective
Optima type
Global minimum
The solution x* E F, is a global minimum of f, if
f(x*) < f(x) , for all x E F , where F union S
Local search algorithm
use only info search space surrounding the current solution to produce a new solution
Global search algorithm
explore the entire search space
exploration การค้นหาบริเวณกว้าง global
exploitation การค้นหาเฉพาะที่ local
Sigma = summation
Big pi = multiplication
MySimpleDiary
ไม่มีความคิดเห็น:
แสดงความคิดเห็น