| 129 | |
| 130 | |
| 131 | int main(int argc, char **argv) { |
| 132 | snoptProblemA catmixa; |
| 133 | |
| 134 | int Cold = 0; |
| 135 | |
| 136 | int nH = 1000; |
| 137 | int n = 3*(nH+1); |
| 138 | int nCon = 2*nH; |
| 139 | int nF = nCon + 1; |
| 140 | |
| 141 | int ObjRow; |
| 142 | double ObjAdd = -1.0; |
| 143 | |
| 144 | double *x = new double[n]; |
| 145 | double *xlow = new double[n]; |
| 146 | double *xupp = new double[n]; |
| 147 | double *xmul = new double[n]; |
| 148 | int *xstate = new int[n]; |
| 149 | |
| 150 | double *F = new double[nF]; |
| 151 | double *Flow = new double[nF]; |
| 152 | double *Fupp = new double[nF]; |
| 153 | double *Fmul = new double[nF]; |
| 154 | int *Fstate = new int[nF]; |
| 155 | |
| 156 | int lenA = 2; |
| 157 | int *iAfun = new int[lenA]; |
| 158 | int *jAvar = new int[lenA]; |
| 159 | double *A = new double[lenA]; |
| 160 | |
| 161 | int lenG = 14*nH + 1; |
| 162 | int *iGfun = new int[lenG]; |
| 163 | int *jGvar = new int[lenG]; |
| 164 | |
| 165 | int iopt; |
| 166 | double ropt; |
| 167 | |
| 168 | int nS = 0, nInf = 0, neA = 0, neG = 0; |
| 169 | int jx1, jx2, ju, ode1, ode2, Obj; |
| 170 | double sInf; |
| 171 | |
| 172 | double inf = 1.0e20; |
| 173 | |
| 174 | int leniu = 100, lenru = 100; |
| 175 | int iu[leniu]; |
| 176 | double ru[lenru]; |
| 177 | |
| 178 | jx1 = 0; |
| 179 | jx2 = jx1 + nH + 1; |
| 180 | ju = jx2 + nH + 1; |
| 181 | |
| 182 | ode1 = 0; |
| 183 | ode2 = ode1 + nH; |
| 184 | Obj = ode2 + nH; |
| 185 | |
| 186 | ObjRow = Obj; |
| 187 | |
| 188 | // Linear terms first |
nothing calls this directly
no test coverage detected