/*Provide dimension of the problem.  Integer >= 1.*/
#define N 4
/*Provide the diameter of the feasible region.*/
/*Provide maximum number of iterations.*/
#define MAXITER 100*N*N/*500*N */

#define PI 3.14159265359

void bounds(double lb[], double ub[]);
int feasible(double x[]);
double objfn(double x[]);

void bounds(double lb[], double ub[])
/*Provide lower and upper bounds for each of N variables.
 Number of bounds is equal to N.*/
{
  lb[0] = -1.;
  ub[0] = 1.;
  lb[1] = -1.;
  ub[1] = 1.;
  lb[2] = -1.;
  ub[2] = 1.;
  lb[3] = -1.;
  ub[3] = 1.;

}

int feasible(double x[])
/*Test feasibility of x.  Return 1 if feasible, 0 if not.*/
{
	return 1;
}

double objfn(double x[])
/*Calculate objective function value of x[].*/
{
	int i;
	double sum1=0., sum2=0., sum=0.;


	for (i=0; i<N; i++)
	{
		sum1 = sum1 + cos(5*PI*x[i]);
		sum2 = sum2 + pow(x[i],2);
	}
	sum = 0.1*sum1 - sum2;
	return (-sum);

}