/*Provide dimension of the problem.  Integer >= 1.*/
#define N 3
/*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.*/
{
	int i;

	for (i=0; i<N; i++)
	{
		lb[i] = -10.0;
		ub[i] = 10.0;
	}
 
}

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[].*/
{
	double sum=0., subsum=0., theta=0.;

	if (x[0]<=0.)
	{
		theta = 1.0/2.0/PI*atan2(x[1],x[0]);
	}
	if (x[0]>0.)
	{
		theta = 1.0/2.0/PI*atan2(x[1],x[0]) + 0.5;
	}

	subsum = pow(sqrt(x[0]*x[0] + x[1]*x[1]) - 1.0,2);
	sum = 100*(pow(x[1]-10*theta,2) + subsum) + x[2]*x[2];
          //printf("%f %f %f\n", theta, subsum, sum);

	return (sum);

}