// test_optmn.java  initial tests, debug set to true 

public class test_optmn_dev
{
  int n2 = 2;
  double xmin[] = {-1.0, -1.0};
  double xmax[] = { 1.0,  1.0};
  double x[] = {0.0, 0.0};
  int maxcnt;
  double tol = 0.001;
  double yfinal = -1000.0;
  double step[] = new double[n2];
  double y;
  int i;

  public test_optmn_dev()
  {
    System.out.println("test_optmn_dev.java running, debug=true");
    optmn_dev OPT = new optmn_dev();
    System.out.println("OPT instantiated");

    maxcnt = 20;
    y = OPT.srchn(
          n2,        // number of parameters 
          x,         // returned best found 
          maxcnt,    // maximum number of tries 
          xmin,      // minimum value for each x 
	  xmax);     // maximum value for each x 
          // f2);    // optional future function to be evaluated 
    System.out.println("f2 search value = "+y+" at:");
    for(i=0; i<n2; i++) System.out.println("x["+i+"] = "+x[i]);

    maxcnt = 100;
    for(i=0; i<n2; i++)
    step[i] = (xmax[i]-xmin[i])*(tol*2.0);
    y = OPT.optmn_dev(
          n2,       // number of parameters 
          x,        // initial and returned optimum 
          yfinal,   // stop when y < yfinal 
          maxcnt,   // maximum number of steps 
          tol,      // relative tolerance on step 
          step,     // start and returned step size 
          xmin,     // minimum value for each x 
          xmax);    // maximum value for each x 
          // f2);   // optional function to be evaluated 
    System.out.println("f2 optimim value = "+y+" at:");
    for(i=0; i<n2; i++) 
       System.out.println("x["+i+"] = "+x[i]);
    System.out.println("test_optmn_dev.java finished");
  } // end test_optm_dev

  public static void main (String[] args)
  {
    new test_optmn_dev();
  }
} // end class test_optmn_dev