int main(int argc,char *argv[]) { MSKrescodee r; const MSKint32t numvar = 6, numcon = 1; MSKboundkeye bkc[] = { MSK_BK_FX }; double blc[] = { 1.0 }; double buc[] = { 1.0 }; MSKboundkeye bkx[] = {MSK_BK_LO, MSK_BK_LO, MSK_BK_LO, MSK_BK_FR, MSK_BK_FR, MSK_BK_FR}; double blx[] = {0.0, 0.0, 0.0, -MSK_INFINITY, -MSK_INFINITY, -MSK_INFINITY}; double bux[] = {+MSK_INFINITY, +MSK_INFINITY, +MSK_INFINITY, +MSK_INFINITY, +MSK_INFINITY, +MSK_INFINITY}; double c[] = {0.0, 0.0, 0.0, 1.0, 1.0, 1.0}; MSKint32t aptrb[] = {0, 1, 2, 3, 3, 3}, aptre[] = {1, 2, 3, 3, 3, 3}, asub[] = {0, 0, 0, 0}; double aval[] = {1.0, 1.0, 2.0}; MSKint32t i,j,csub[3]; MSKenv_t env = NULL; MSKtask_t task = NULL; /* Create the mosek environment. */ r = MSK_makeenv(&env,NULL); if ( r==MSK_RES_OK ) { /* Create the optimization task. */ r = MSK_maketask(env,numcon,numvar,&task); if ( r==MSK_RES_OK ) { MSK_linkfunctotaskstream(task,MSK_STREAM_LOG,NULL,printstr); /* Append 'numcon' empty constraints. The constraints will initially have no bounds. */ if ( r == MSK_RES_OK ) r = MSK_appendcons(task,numcon); /* Append 'numvar' variables. The variables will initially be fixed at zero (x=0). */ if ( r == MSK_RES_OK ) r = MSK_appendvars(task,numvar); for(j=0; j<numvar && r == MSK_RES_OK; ++j) { /* Set the linear term c_j in the objective.*/ if(r == MSK_RES_OK) r = MSK_putcj(task,j,c[j]); /* Set the bounds on variable j. blx[j] <= x_j <= bux[j] */ if(r == MSK_RES_OK) r = MSK_putvarbound(task, j, /* Index of variable.*/ bkx[j], /* Bound key.*/ blx[j], /* Numerical value of lower bound.*/ bux[j]); /* Numerical value of upper bound.*/ /* Input column j of A */ if(r == MSK_RES_OK) r = MSK_putacol(task, j, /* Variable (column) index.*/ aptre[j]-aptrb[j], /* Number of non-zeros in column j.*/ asub+aptrb[j], /* Pointer to row indexes of column j.*/ aval+aptrb[j]); /* Pointer to Values of column j.*/ } /* Set the bounds on constraints. for i=1, ...,numcon : blc[i] <= constraint i <= buc[i] */ for(i=0; i<numcon && r==MSK_RES_OK; ++i) r = MSK_putconbound(task, i, /* Index of constraint.*/ bkc[i], /* Bound key.*/ blc[i], /* Numerical value of lower bound.*/ buc[i]); /* Numerical value of upper bound.*/ if ( r==MSK_RES_OK ) { /* Append the first cone. */ csub[0] = 3; csub[1] = 0; csub[2] = 1; r = MSK_appendcone(task, MSK_CT_QUAD, 0.0, /* For future use only, can be set to 0.0 */ 3, csub); } if ( r==MSK_RES_OK ) { /* Append the second cone. */ csub[0] = 4; csub[1] = 5; csub[2] = 2; r = MSK_appendcone(task, MSK_CT_RQUAD, 0.0, 3, csub); } if ( r==MSK_RES_OK ) { MSKrescodee trmcode; /* Run optimizer */ r = MSK_optimizetrm(task,&trmcode); /* Print a summary containing information about the solution for debugging purposes*/ MSK_solutionsummary (task,MSK_STREAM_MSG); if ( r==MSK_RES_OK ) { MSKsolstae solsta; MSK_getsolsta (task,MSK_SOL_ITR,&solsta); switch(solsta) { case MSK_SOL_STA_OPTIMAL: case MSK_SOL_STA_NEAR_OPTIMAL: { double *xx = NULL; xx = calloc(numvar,sizeof(double)); if ( xx ) { MSK_getxx (task, MSK_SOL_ITR, /* Request the interior solution. */ xx); printf("Optimal primal solution\n"); for(j=0; j<numvar; ++j) printf("x[%d]: %e\n",j,xx[j]); } else { r = MSK_RES_ERR_SPACE; } free(xx); } break; case MSK_SOL_STA_DUAL_INFEAS_CER: case MSK_SOL_STA_PRIM_INFEAS_CER: case MSK_SOL_STA_NEAR_DUAL_INFEAS_CER: case MSK_SOL_STA_NEAR_PRIM_INFEAS_CER: printf("Primal or dual infeasibility certificate found.\n"); break; case MSK_SOL_STA_UNKNOWN: printf("The status of the solution could not be determined.\n"); break; default: printf("Other solution status."); break; } } else { printf("Error while optimizing.\n"); } } if (r != MSK_RES_OK) { /* In case of an error print error code and description. */ char symname[MSK_MAX_STR_LEN]; char desc[MSK_MAX_STR_LEN]; printf("An error occurred while optimizing.\n"); MSK_getcodedesc (r, symname, desc); printf("Error %s - '%s'\n",symname,desc); } } /* Delete the task and the associated data. */ MSK_deletetask(&task); } /* Delete the environment and the associated data. */ MSK_deleteenv(&env); return ( r ); } /* main */
int main(int argc,char *argv[]) { const MSKint32t numvar = 3, numcon = 3; MSKint32t i,j; double c[] = {1.5, 2.5, 3.0}; MSKint32t ptrb[] = {0, 3, 6}, ptre[] = {3, 6, 9}, asub[] = { 0, 1, 2, 0, 1, 2, 0, 1, 2}; double aval[] = { 2.0, 3.0, 2.0, 4.0, 2.0, 3.0, 3.0, 3.0, 2.0}; MSKboundkeye bkc[] = {MSK_BK_UP, MSK_BK_UP, MSK_BK_UP }; double blc[] = {-MSK_INFINITY, -MSK_INFINITY, -MSK_INFINITY}; double buc[] = {100000, 50000, 60000}; MSKboundkeye bkx[] = {MSK_BK_LO, MSK_BK_LO, MSK_BK_LO}; double blx[] = {0.0, 0.0, 0.0,}; double bux[] = {+MSK_INFINITY, +MSK_INFINITY,+MSK_INFINITY}; double *xx=NULL; MSKenv_t env; MSKtask_t task; MSKint32t varidx,conidx; MSKrescodee r; /* Create the mosek environment. */ r = MSK_makeenv(&env,NULL); if ( r==MSK_RES_OK ) { /* Create the optimization task. */ r = MSK_maketask(env,numcon,numvar,&task); /* Directs the log task stream to the 'printstr' function. */ MSK_linkfunctotaskstream(task,MSK_STREAM_LOG,NULL,printstr); /* Append the constraints. */ if (r == MSK_RES_OK) r = MSK_appendcons(task,numcon); /* Append the variables. */ if (r == MSK_RES_OK) r = MSK_appendvars(task,numvar); /* Put C. */ if (r == MSK_RES_OK) r = MSK_putcfix(task, 0.0); if (r == MSK_RES_OK) for(j=0; j<numvar; ++j) r = MSK_putcj(task,j,c[j]); /* Put constraint bounds. */ if (r == MSK_RES_OK) for(i=0; i<numcon; ++i) r = MSK_putconbound(task,i,bkc[i],blc[i],buc[i]); /* Put variable bounds. */ if (r == MSK_RES_OK) for(j=0; j<numvar; ++j) r = MSK_putvarbound(task,j,bkx[j],blx[j],bux[j]); /* Put A. */ if (r == MSK_RES_OK) if ( numcon>0 ) for(j=0; j<numvar; ++j) r = MSK_putacol(task, j, ptre[j]-ptrb[j], asub+ptrb[j], aval+ptrb[j]); if (r == MSK_RES_OK) r = MSK_putobjsense(task, MSK_OBJECTIVE_SENSE_MAXIMIZE); if (r == MSK_RES_OK) r = MSK_optimizetrm(task,NULL); if (r == MSK_RES_OK) { xx = calloc(numvar,sizeof(double)); if ( !xx ) r = MSK_RES_ERR_SPACE; } if (r == MSK_RES_OK) r = MSK_getxx(task, MSK_SOL_BAS, /* Basic solution. */ xx); /* Make a change to the A matrix */ if (r == MSK_RES_OK) r = MSK_putaij(task, 0, 0, 3.0); if (r == MSK_RES_OK) r = MSK_optimizetrm(task,NULL); /* Get index of new variable, this should be 3 */ if (r == MSK_RES_OK) r = MSK_getnumvar(task,&varidx); /* Append a new variable x_3 to the problem */ if (r == MSK_RES_OK) r = MSK_appendvars(task,1); /* Set bounds on new variable */ if (r == MSK_RES_OK) r = MSK_putvarbound(task, varidx, MSK_BK_LO, 0, +MSK_INFINITY); /* Change objective */ if (r == MSK_RES_OK) r = MSK_putcj(task,varidx,1.0); /* Put new values in the A matrix */ if (r == MSK_RES_OK) { MSKint32t acolsub[] = {0, 2}; double acolval[] = {4.0, 1.0}; r = MSK_putacol(task, varidx, /* column index */ 2, /* num nz in column*/ acolsub, acolval); } /* Change optimizer to free simplex and reoptimize */ if (r == MSK_RES_OK) r = MSK_putintparam(task,MSK_IPAR_OPTIMIZER,MSK_OPTIMIZER_FREE_SIMPLEX); if (r == MSK_RES_OK) r = MSK_optimizetrm(task,NULL); /* Get index of new constraint*/ if (r == MSK_RES_OK) r = MSK_getnumcon(task,&conidx); /* Append a new constraint */ if (r == MSK_RES_OK) r = MSK_appendcons(task,1); /* Set bounds on new constraint */ if (r == MSK_RES_OK) r = MSK_putconbound(task, conidx, MSK_BK_UP, -MSK_INFINITY, 30000); /* Put new values in the A matrix */ if (r == MSK_RES_OK) { MSKidxt arowsub[] = {0, 1, 2, 3 }; double arowval[] = {1.0, 2.0, 1.0, 1.0}; r = MSK_putarow(task, conidx, /* row index */ 4, /* num nz in row*/ arowsub, arowval); } if (r == MSK_RES_OK) r = MSK_optimizetrm(task,NULL); if ( xx ) free(xx); MSK_deletetask(&task); } MSK_deleteenv(&env); printf("Return code: %d (0 means no error occured.)\n",r); return ( r ); } /* main */
int main(int argc,char *argv[]) { const MSKint32t numvar = 2, numcon = 2; double c[] = { 1.0, 0.64 }; MSKboundkeye bkc[] = { MSK_BK_UP, MSK_BK_LO }; double blc[] = { -MSK_INFINITY,-4.0 }; double buc[] = { 250.0, MSK_INFINITY }; MSKboundkeye bkx[] = { MSK_BK_LO, MSK_BK_LO }; double blx[] = { 0.0, 0.0 }; double bux[] = { MSK_INFINITY, MSK_INFINITY }; MSKint32t aptrb[] = { 0, 2 }, aptre[] = { 2, 4 }, asub[] = { 0, 1, 0, 1 }; double aval[] = { 50.0, 3.0, 31.0, -2.0 }; MSKint32t i,j; MSKenv_t env = NULL; MSKtask_t task = NULL; MSKrescodee r; /* Create the mosek environment. */ r = MSK_makeenv(&env,NULL); /* Check if return code is ok. */ if ( r==MSK_RES_OK ) { /* Create the optimization task. */ r = MSK_maketask(env,0,0,&task); if ( r==MSK_RES_OK ) r = MSK_linkfunctotaskstream(task,MSK_STREAM_LOG,NULL,printstr); /* Append 'numcon' empty constraints. The constraints will initially have no bounds. */ if ( r == MSK_RES_OK ) r = MSK_appendcons(task,numcon); /* Append 'numvar' variables. The variables will initially be fixed at zero (x=0). */ if ( r == MSK_RES_OK ) r = MSK_appendvars(task,numvar); /* Optionally add a constant term to the objective. */ if ( r ==MSK_RES_OK ) r = MSK_putcfix(task,0.0); for(j=0; j<numvar && r == MSK_RES_OK; ++j) { /* Set the linear term c_j in the objective.*/ if(r == MSK_RES_OK) r = MSK_putcj(task,j,c[j]); /* Set the bounds on variable j. blx[j] <= x_j <= bux[j] */ if(r == MSK_RES_OK) r = MSK_putvarbound(task, j, /* Index of variable.*/ bkx[j], /* Bound key.*/ blx[j], /* Numerical value of lower bound.*/ bux[j]); /* Numerical value of upper bound.*/ /* Input column j of A */ if(r == MSK_RES_OK) r = MSK_putacol(task, j, /* Variable (column) index.*/ aptre[j]-aptrb[j], /* Number of non-zeros in column j.*/ asub+aptrb[j], /* Pointer to row indexes of column j.*/ aval+aptrb[j]); /* Pointer to Values of column j.*/ } /* Set the bounds on constraints. for i=1, ...,numcon : blc[i] <= constraint i <= buc[i] */ for(i=0; i<numcon && r==MSK_RES_OK; ++i) r = MSK_putconbound(task, i, /* Index of constraint.*/ bkc[i], /* Bound key.*/ blc[i], /* Numerical value of lower bound.*/ buc[i]); /* Numerical value of upper bound.*/ /* Specify integer variables. */ for(j=0; j<numvar && r == MSK_RES_OK; ++j) r = MSK_putvartype(task,j,MSK_VAR_TYPE_INT); if ( r==MSK_RES_OK ) r = MSK_putobjsense(task, MSK_OBJECTIVE_SENSE_MAXIMIZE); if ( r==MSK_RES_OK ) { MSKrescodee trmcode; /* Run optimizer */ r = MSK_optimizetrm(task,&trmcode); /* Print a summary containing information about the solution for debugging purposes*/ MSK_solutionsummary (task,MSK_STREAM_MSG); if ( r==MSK_RES_OK ) { MSKint32t j; MSKsolstae solsta; double *xx = NULL; MSK_getsolsta (task,MSK_SOL_ITG,&solsta); xx = calloc(numvar,sizeof(double)); if ( xx ) { switch(solsta) { case MSK_SOL_STA_INTEGER_OPTIMAL: case MSK_SOL_STA_NEAR_INTEGER_OPTIMAL : MSK_getxx(task, MSK_SOL_ITG, /* Request the integer solution. */ xx); printf("Optimal solution.\n"); for(j=0; j<numvar; ++j) printf("x[%d]: %e\n",j,xx[j]); break; case MSK_SOL_STA_PRIM_FEAS: /* A feasible but not necessarily optimal solution was located. */ MSK_getxx(task,MSK_SOL_ITG,xx); printf("Feasible solution.\n"); for(j=0; j<numvar; ++j) printf("x[%d]: %e\n",j,xx[j]); break; case MSK_SOL_STA_UNKNOWN: { MSKprostae prosta; MSK_getprosta(task,MSK_SOL_ITG,&prosta); switch (prosta) { case MSK_PRO_STA_PRIM_INFEAS_OR_UNBOUNDED: printf("Problem status Infeasible or unbounded\n"); break; case MSK_PRO_STA_PRIM_INFEAS: printf("Problem status Infeasible.\n"); break; case MSK_PRO_STA_UNKNOWN: printf("Problem status unknown.\n"); break; default: printf("Other problem status."); break; } } break; default: printf("Other solution status."); break; } } else { r = MSK_RES_ERR_SPACE; } free(xx); } } if (r != MSK_RES_OK) { /* In case of an error print error code and description. */ char symname[MSK_MAX_STR_LEN]; char desc[MSK_MAX_STR_LEN]; printf("An error occurred while optimizing.\n"); MSK_getcodedesc (r, symname, desc); printf("Error %s - '%s'\n",symname,desc); } MSK_deletetask(&task); } MSK_deleteenv(&env); printf("Return code: %d.\n",r); return ( r ); } /* main */
int do_thing() { const MSKint32t numvar = 4, numcon = 3; double c[] = {3.0, 1.0, 5.0, 1.0}; /* Below is the sparse representation of the A matrix stored by column. */ MSKint32t aptrb[] = {0, 2, 5, 7}, aptre[] = {2, 5, 7, 9}, asub[] = { 0, 1, 0, 1, 2, 0, 1, 1, 2}; double aval[] = { 3.0, 2.0, 1.0, 1.0, 2.0, 2.0, 3.0, 1.0, 3.0}; /* Bounds on constraints. */ MSKboundkeye bkc[] = {MSK_BK_FX, MSK_BK_LO, MSK_BK_UP }; double blc[] = {30.0, 15.0, -MSK_INFINITY}; double buc[] = {30.0, +MSK_INFINITY, 25.0 }; /* Bounds on variables. */ MSKboundkeye bkx[] = {MSK_BK_LO, MSK_BK_RA, MSK_BK_LO, MSK_BK_LO }; double blx[] = {0.0, 0.0, 0.0, 0.0 }; double bux[] = {+MSK_INFINITY, 10.0, +MSK_INFINITY, +MSK_INFINITY }; MSKenv_t env = NULL; MSKtask_t task = NULL; MSKrescodee r; MSKint32t i,j; /* Create the mosek environment. */ r = MSK_makeenv(&env,NULL); if ( r==MSK_RES_OK ) { /* Create the optimization task. */ r = MSK_maketask(env,numcon,numvar,&task); /* Directs the log task stream to the 'printstr' function. */ if ( r==MSK_RES_OK ) r = MSK_linkfunctotaskstream(task,MSK_STREAM_LOG,NULL,printstr); /* Append 'numcon' empty constraints. The constraints will initially have no bounds. */ if ( r == MSK_RES_OK ) r = MSK_appendcons(task,numcon); /* Append 'numvar' variables. The variables will initially be fixed at zero (x=0). */ if ( r == MSK_RES_OK ) r = MSK_appendvars(task,numvar); for(j=0; j<numvar && r == MSK_RES_OK; ++j) { /* Set the linear term c_j in the objective.*/ if(r == MSK_RES_OK) r = MSK_putcj(task,j,c[j]); /* Set the bounds on variable j. blx[j] <= x_j <= bux[j] */ if(r == MSK_RES_OK) r = MSK_putvarbound(task, j, /* Index of variable.*/ bkx[j], /* Bound key.*/ blx[j], /* Numerical value of lower bound.*/ bux[j]); /* Numerical value of upper bound.*/ /* Input column j of A */ if(r == MSK_RES_OK) r = MSK_putacol(task, j, /* Variable (column) index.*/ aptre[j]-aptrb[j], /* Number of non-zeros in column j.*/ asub+aptrb[j], /* Pointer to row indexes of column j.*/ aval+aptrb[j]); /* Pointer to Values of column j.*/ } /* Set the bounds on constraints. for i=1, ...,numcon : blc[i] <= constraint i <= buc[i] */ for(i=0; i<numcon && r==MSK_RES_OK; ++i) r = MSK_putconbound(task, i, /* Index of constraint.*/ bkc[i], /* Bound key.*/ blc[i], /* Numerical value of lower bound.*/ buc[i]); /* Numerical value of upper bound.*/ /* Maximize objective function. */ if (r == MSK_RES_OK) r = MSK_putobjsense(task, MSK_OBJECTIVE_SENSE_MAXIMIZE); if ( r==MSK_RES_OK ) { MSKrescodee trmcode; /* Run optimizer */ r = MSK_optimizetrm(task,&trmcode); /* Print a summary containing information about the solution for debugging purposes. */ MSK_solutionsummary (task,MSK_STREAM_LOG); if ( r==MSK_RES_OK ) { MSKsolstae solsta; if ( r==MSK_RES_OK ) r = MSK_getsolsta (task, MSK_SOL_BAS, &solsta); switch(solsta) { case MSK_SOL_STA_OPTIMAL: case MSK_SOL_STA_NEAR_OPTIMAL: { double *xx = (double*) calloc(numvar,sizeof(double)); if ( xx ) { MSK_getxx(task, MSK_SOL_BAS, /* Request the basic solution. */ xx); printf("Optimal primal solution\n"); for(j=0; j<numvar; ++j) printf("x[%d]: %e\n",j,xx[j]); free(xx); } else r = MSK_RES_ERR_SPACE; break; } case MSK_SOL_STA_DUAL_INFEAS_CER: case MSK_SOL_STA_PRIM_INFEAS_CER: case MSK_SOL_STA_NEAR_DUAL_INFEAS_CER: case MSK_SOL_STA_NEAR_PRIM_INFEAS_CER: printf("Primal or dual infeasibility certificate found.\n"); break; case MSK_SOL_STA_UNKNOWN: { char symname[MSK_MAX_STR_LEN]; char desc[MSK_MAX_STR_LEN]; /* If the solutions status is unknown, print the termination code indicating why the optimizer terminated prematurely. */ MSK_getcodedesc(trmcode, symname, desc); printf("The solution status is unknown.\n"); printf("The optimizer terminitated with code: %s\n",symname); break; } default: printf("Other solution status.\n"); break; } } } if (r != MSK_RES_OK) { /* In case of an error print error code and description. */ char symname[MSK_MAX_STR_LEN]; char desc[MSK_MAX_STR_LEN]; printf("An error occurred while optimizing.\n"); MSK_getcodedesc (r, symname, desc); printf("Error %s - '%s'\n",symname,desc); } /* Delete the task and the associated data. */ MSK_deletetask(&task); } /* Delete the environment and the associated data. */ MSK_deleteenv(&env); return r; }