/* rate-finding algorithm */
/* produced anal.txt--the infinite patch resource gathering rate */

#include	<stdlib.h>
#include	<math.h>
#include 	<stdio.h>
	
#define	NUMSTEPS 	40

double	log(double), exp(double), ggg(double);
double	alpha, beta, k, cost1, cost2, n, rstar;
FILE *fileid;

int main(void)
{
	int	step;

	alpha = 0.05;
	beta = 0.1;
	k = 1.0;
	cost1 = 0.1;
	cost2 = 0.01;
	n = 20.0;
	rstar = (alpha-beta/n)*k/alpha;

	fileid = fopen("analrate20.txt","w");

	for(step=2;step<NUMSTEPS;step++)
	{
		printf("%d %f\n",step,ggg((double)step)/(double)step);
		fprintf(fileid,"%d %f\n",step,ggg((double)step)/(double)step);
	}
}

double	ggg(double x)
{
	double stuff;

	stuff = ( (alpha*rstar+k*(beta-alpha))*exp((beta-alpha)*x)
				-alpha*rstar) / k / (beta-alpha);

	return( (beta*k/alpha)*(log( stuff ) - (beta-alpha)*x) 
			- (cost1+cost2*x) );
}