#include "simplex.h"
#include "rxn.h"
int NSF, NPF;
int *splst, *plist;
extern int splist();

double **matrix(nr,nc)
{
int i;
double **m;
m = (double **) malloc((unsigned) (nr+1)*sizeof(double *));
for(i = 0; i <= nr; i++){
  m[i] = (double *)malloc((unsigned)(nc+1)*sizeof(double));
  if (!m[i]){
    printf("out of memory\n"); exit(0);
  }
}
return m;
}

int M, NVPP, N, *h, *l;
double *next, *mean, *error, *maxerr, *step, **data, **simp;

enter(name)
char *name;
{
     register int   i, j;

   if ((fpdata = fopen(name, "r")) == NULL) {
      fprintf(stderr, "simplex: can't open %s\n", name);
      exit(1);
   }

     printf("SIMPLEX Optimization\n\n");

     fscanf(fpdata, "%d", &maxiter);
     fscanf(fpdata, "%d %d", &NPF, &NSF);
     plist = (int *)malloc((NPF+1)*sizeof(int));
     splst = (int *)malloc((NSF+1)*sizeof(int));
     for (i=0 ; i<NPF ; i++)  fscanf(fpdata, "%d", &plist[i]);
     NSF = splist(fpdata,splst);
     M = NPF; N = M+1; NVPP = NSF+1;
h = (int *) malloc(N*sizeof(int));
l = (int *) malloc(N*sizeof(int));
next = (double *)malloc(N*sizeof(double));
mean  = (double *)malloc(N*sizeof(double));
error = (double *)malloc(N*sizeof(double));
maxerr = (double *)malloc(N*sizeof(double));
step = (double *)malloc(N*sizeof(double));
simp = matrix(N,N);
data = matrix(200,NVPP);

     for (i=0 ; i<M ; i++)  fscanf(fpdata, "%F", &step[i]);
     for (i=0 ; i<N ; i++)  fscanf(fpdata, "%F", &maxerr[i]);
     np = 0;
     while (!feof(fpdata)) {
          for (j=0 ; j<NVPP ; j++) {
               if (fscanf(fpdata, "%F", &data[np][j]) == EOF)
                    break;
          }
          np++;
     }
     np--;
     for (i=0 ; i<M ; i++) {j = plist[i]; simp[0][i] = R[j].k;}

fclose(fpdata);
}