92#define ENTRY(i,j) (N * (j) + (i))
105 int pivot[3] = {0, 1, 2};
121 for(
k = 0;
k <
N; ++
k )
127 for(
i =
k+1;
i <
N; ++
i )
149 for(
i =
k+1;
i <
N; ++
i )
156 for(
j =
k+1;
j <
N; ++
j )
166 for(
k = 1;
k <
N; ++
k )
172 for(
j = 0;
j <
k; ++
j )
181 for(
k =
N-2;
k >= 0; --
k )
187 for(
j =
k+1;
j <
N; ++
j )
238 for(
k = 0;
k <
N; ++
k )
242 for(
k = 0;
k <
N; ++
k )
248 for(
i =
k+1;
i <
N; ++
i )
270 for(
i =
k+1;
i <
N; ++
i )
277 for(
j =
k+1;
j <
N; ++
j )
287 for(
k = 1;
k <
N; ++
k )
293 for(
j = 0;
j <
k; ++
j )
302 for(
k =
N-2;
k >= 0; --
k )
308 for(
j =
k+1;
j <
N; ++
j )
#define SCIP_ALLOC_TERMINATE(retcode, x, TERM)
SCIP_RETCODE SCIPincludeNlpSolverIpopt(SCIP *scip)
const char * SCIPgetSolverNameIpopt(void)
SCIP_RETCODE SCIPcallLapackDsyevIpopt(SCIP_Bool computeeigenvectors, int N, SCIP_Real *a, SCIP_Real *w)
SCIP_RETCODE SCIPsolveLinearEquationsIpopt(int N, SCIP_Real *A, SCIP_Real *b, SCIP_Real *x, SCIP_Bool *success)
void * SCIPgetNlpiOracleIpopt(SCIP_NLPIPROBLEM *nlpiproblem)
SCIP_Bool SCIPisIpoptAvailableIpopt(void)
const char * SCIPgetSolverDescIpopt(void)
assert(minobj< SCIPgetCutoffbound(scip))
memory allocation routines
#define BMSduplicateMemoryArray(ptr, source, num)
#define BMSallocMemoryArray(ptr, num)
#define BMScopyMemoryArray(ptr, source, num)
#define BMSfreeMemoryArrayNull(ptr)
static SCIP_RETCODE solveLinearProb3(SCIP_Real *A, SCIP_Real *b, SCIP_Real *x, SCIP_Bool *success)
public methods for message output
enum SCIP_Retcode SCIP_RETCODE