unc_nn_step.m

it contains many classic Test Problems for Unconstrained Optimization such as camel6,treccani,goldst

function [fval]=unc_nn_step(x)
%reference:
%note that you can get the formulation of unc_nn_step from some
%aritcles,such as
%(1)JS Chun, HK Jung, SY Hahn A study on comparison of optimization
%performances between immune algorithm and other heuristic algorithms Magnetics, IEEE Transactions on, 1998 ：2912－2915
%case 2
%algorithm:
%below code is  edited according to 
%(1)JS Chun, HK Jung, SY Hahn A study on comparison of optimization
%performances between immune algorithm and other heuristic algorithms Magnetics, IEEE Transactions on, 1998 ：2912－2915
%case 2
%solution:
%maximize:
%this function is a n-dimensional step function.
% The shape of the step function is flat over each variable. If
% some algorithm could not use variable step size, it cannot
% find the optimum.
% where the bounds are 1<=xi<=10.1;
% The global minimum is at x*=9.5~10.1*ones(n,1)
%and f(x*)=16*n;





%Copyright:
% programmers:oiltowater.
% It comply with the GPL2.0
% Copyright 2006  oiltowater 

a=sum(round(x));
n=size(x,1);
fval=6*n+a;
%maximize
fval=-fval;