| 21 | /*--------------------------------------------------------------------*/ |
| 22 | |
| 23 | int main(int argc, char **argv) { |
| 24 | sqoptProblem hs118("hs118"); |
| 25 | |
| 26 | int i, neA; |
| 27 | int n = 15; |
| 28 | int m = 18; |
| 29 | int nnH = 15; |
| 30 | int ncObj = 0; |
| 31 | int lenA = 54; |
| 32 | int iObj = 17; |
| 33 | int nS = 0, nInf; |
| 34 | double ObjAdd = 0, sInf = 0, objective; |
| 35 | |
| 36 | int *indA = new int[lenA]; |
| 37 | int *locA = new int[n+1]; |
| 38 | double *valA = new double[lenA]; |
| 39 | |
| 40 | double cObj[1]; |
| 41 | double *x = new double[n+m]; |
| 42 | double *bl = new double[n+m]; |
| 43 | double *bu = new double[n+m]; |
| 44 | double *pi = new double[m]; |
| 45 | double *rc = new double[n+m]; |
| 46 | int *hs = new int[n+m]; |
| 47 | int *eType = new int[n+m]; |
| 48 | |
| 49 | double infBnd = 1.0e20; |
| 50 | |
| 51 | int Cold = 0, Basis = 1, Warm = 2; |
| 52 | |
| 53 | // Set bounds |
| 54 | for (i = n; i < n+m; i++) { |
| 55 | bl[i] = 0; |
| 56 | bu[i] = infBnd; |
| 57 | } |
| 58 | bl[n+iObj] = -infBnd; |
| 59 | |
| 60 | bl[n] = -7; |
| 61 | bu[n] = 6; |
| 62 | |
| 63 | bl[n+1] = -7; |
| 64 | bu[n+1] = 6; |
| 65 | |
| 66 | bl[n+2] = -7; |
| 67 | bu[n+2] = 6; |
| 68 | |
| 69 | bl[n+3] = -7; |
| 70 | bu[n+3] = 6; |
| 71 | |
| 72 | bl[n+4] = -7; |
| 73 | bu[n+4] = 7; |
| 74 | |
| 75 | bl[n+5] = -7; |
| 76 | bu[n+5] = 7; |
| 77 | |
| 78 | bl[n+6] = -7; |
| 79 | bu[n+6] = 7; |
| 80 |
nothing calls this directly
no test coverage detected