With CPSO algorithm for solving constrained function optimization problems. The objective function f = (x (3)+2)* x (2)* x (1) ^ 2, find the minimum value constraint g (1) = 1-x (2) ^ 3* x (3)/(71785* x (1) ^ 4) g (2) = (4* x (2) ^ 2-x (1)* x (2))/(12566* (x (2)* x (1 ) ^ 3-x (1) ^ 4))+1/(5108* x (1) ^ 2)-1 g (3) = 1-140.45* x (1)/(x (2) ^ 2* x (3)) g (4) = (x (1)+x (2))/1.5-1 decision variable ranges: x1-[0.05,2], x2-[0.25,1.3], x3-[ 2,15]

CPSO\CPSO.asv
....\CPSO.m
....\CPSOfiness1.asv
....\CPSOfiness1.m
....\CPSOfiness2.asv
....\CPSOfiness2.m
....\initialxv.asv
....\initialxv.m
....\xvfile2.mat
....\第3章PSO求解约束优化问题.ppt
CPSO

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．