Function main

snopt-interface/cppexamples/sntoyB_w.cpp:67–169

/*--------------------------------------------------------------------*/

int main(int argc, char **argv) {
  int n      =  2;
  int m      =  3;
  int ne     =  5;
  int nnCon  =  2;
  int nnObj  =  0;
  int nnJac  =  2;
  int negCon = -1; // if you don't know the size of gCon

  int nS = 0, nInf;
  double objective, sInf;

  int    leniw  = 1000;
  int    lenrw  = 1000;
  int    *iw    = new int[leniw];
  double *rw    = new double[lenrw];

  snoptProblemB ToyProb("ToyB", iw, leniw, rw, lenrw);

  int    *indJ = new int[ne];
  int    *locJ = new int[n+1];
  double *valJ = new double[ne];

  double *x  = new double[n+m];
  double *bl = new double[n+m];
  double *bu = new double[n+m];
  double *pi = new double[m];
  double *rc = new double[n+m];
  int    *hs = new    int[n+m];

  int    iObj    = 2;
  double ObjAdd  = 0;

  int Cold = 0, Basis = 1, Warm = 2;


  // Set the upper and lower bounds.
  bl[0] =     0;  bu[0] = 1e20;
  bl[1] = -1e20;  bu[1] = 1e20;
  bl[2] = -1e20;  bu[2] =    4;
  bl[3] = -1e20;  bu[3] =    5;
  bl[4] = -1e20;  bu[4] = 1e20;

  // Initialize states, x and multipliers
  for (int i = 0; i < n+m; i++) {
    hs[i] = 0;
     x[i] = 0;
    rc[i] = 0;
  }

  for (int i = 0; i < m; i++) {
    pi[i] = 0;
  }

  x[0]    = 1.0;
  x[1]    = 1.0;

  // Set up the Jacobian matrix