| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/include/ |
| H A D | sym_master.h | 55 MIPdesc *mip; /*For holding the description when read in from MPS
58 MIPdesc *orig_mip; /*For holding the original description if
60 MIPdesc *prep_mip; /* For holding the presolved description if
150 MIPdesc *create_copy_mip_desc PROTO((MIPdesc *mip));
153 double get_lb_for_new_rhs PROTO((bc_node *root, MIPdesc *mip, int cnt,
155 double get_ub_for_new_rhs PROTO((bc_node *root, MIPdesc *mip, int cnt,
158 double get_lb_for_new_obj PROTO((bc_node *root, MIPdesc *mip, int cnt,
161 double get_ub_for_new_obj PROTO((bc_node *root, MIPdesc *mip, int cnt,
163 int check_feasibility_new_rhs PROTO((bc_node * node, MIPdesc * mip,
|
| H A D | sym_prep.h | 187 MIPdesc * mip;
188 MIPdesc * orig_mip;
345 int prep_deleted_row_update_info(MIPdesc *mip, int row_ind);
363 int prep_get_row_bounds(MIPdesc *mip, int r_ind, double etol);
376 int prep_merge_solution(MIPdesc *orig_mip, MIPdesc *prep_mip, int *sol_xlength,
379 int prep_check_feasible(MIPdesc *mip, double *sol, double etol);
|
| H A D | sym_lp_solver.h | 177 MIPdesc *mip;
235 void free_mip_desc PROTO((MIPdesc *mip));
301 int read_mps PROTO((MIPdesc *mip, char *infile, char *probname, int verbosity));
302 int read_lp PROTO((MIPdesc *mip, char *infile, char *probname, int verbosity));
305 void write_mip_desc_mps PROTO((MIPdesc *mip, char *fname));
306 void write_mip_desc_lp PROTO((MIPdesc *mip, char *fname));
329 int read_gmpl PROTO((MIPdesc *mip, char *modelfile, char *datafile,
|
| H A D | symphony.h | 186 typedef struct MIPDESC MIPdesc; typedef
321 MIPdesc *sym_create_copy_mip_desc PROTO((sym_environment *env));
322 MIPdesc *sym_get_presolved_mip_desc PROTO((sym_environment *env));
|
| H A D | sym_lp_u.h | 37 int user_create_subproblem PROTO((void *user, int *indices, MIPdesc *mip,
|
| H A D | symphony_api.h | 146 MIPdesc *sym_create_copy_mip_desc PROTO((sym_environment *env));
|
| H A D | sym_types.h | 883 }MIPdesc; typedef
|
| H A D | sym_lp.h | 125 MIPdesc *mip; /* Holds the MIP description when read in from MPS */
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/SPP/src/Master/ |
| H A D | spp_main.c | 148 env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); in spp_test()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/MPP/src/Master/ |
| H A D | mpp_main.c | 145 env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); in mpp_test()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/SPP+CUTS/src/Master/ |
| H A D | spp_main.c | 153 env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); in spp_test()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/Master/ |
| H A D | master_prep.c | 155 MIPdesc *mip = P->mip; in prep_solve_desc()
233 MIPdesc *mip; in prep_load_problem()
378 MIPdesc *mip = prep->P->mip;
500 MIPdesc *mip = prep->P->mip;
581 MIPdesc *mip = prep->P->mip;
603 MIPdesc *mip = prep->P->mip;
|
| H A D | master_prep_base.c | 64 MIPdesc *mip = P->mip; in prep_basic()
557 MIPdesc *mip = P->mip; in prep_delete_duplicate_rows_cols()
1492 MIPdesc *mip = P->mip; in prep_substitute_cols()
2232 MIPdesc *mip = P->mip; in prep_force_row_bounds()
2355 MIPdesc *mip = P->mip; in prep_improve_variable()
3012 MIPdesc *mip = P->mip; in prep_modified_cols_update_info()
3595 MIPdesc *mip = P->mip; in prep_check_redundancy()
4072 MIPdesc *mip = P->mip; in prep_initialize_mipinfo()
4705 MIPdesc *mip = P->mip; in prep_integerize_bounds()
4799 MIPdesc *mip = P->mip; in prep_integerize_var()
[all …]
|
| H A D | master_wrapper.c | 49 env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); in initialize_u()
517 MIPdesc *mip = env->mip; in send_lp_data_u()
|
| H A D | main.c | 770 env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); in sym_free_env()
|
| H A D | master_func.c | 988 MIPdesc *mip = env->mip; in check_better_solution()
3479 MIPdesc *create_copy_mip_desc(MIPdesc * mip) in create_copy_mip_desc()
3481 MIPdesc * mip_copy; in create_copy_mip_desc()
3485 mip_copy = (MIPdesc*) calloc(1, sizeof(MIPdesc)); in create_copy_mip_desc()
3486 memcpy(mip_copy, mip, sizeof(MIPdesc)); in create_copy_mip_desc()
3857 double get_lb_for_new_rhs(bc_node *root, MIPdesc *mip, int cnt, int *ind, in get_lb_for_new_rhs()
3940 double get_ub_for_new_obj(bc_node *root, MIPdesc *mip, int cnt, in get_ub_for_new_obj()
4016 double get_ub_for_new_rhs(bc_node *root, MIPdesc *mip, int cnt, in get_ub_for_new_rhs()
4127 int check_feasibility_new_rhs(bc_node * node, MIPdesc * mip, in check_feasibility_new_rhs()
4296 MIPdesc *tmp; in free_master()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/MATCH/src/Master/ |
| H A D | user_main.c | 235 env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); in match_test()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/USER/src/LP/ |
| H A D | user_lp.c | 53 int user_create_subproblem(void *user, int *indices, MIPdesc *mip, in user_create_subproblem()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/LP/ |
| H A D | lp_solver.c | 89 void free_mip_desc(MIPdesc *mip) in free_mip_desc()
1449 int read_lp(MIPdesc *desc, char *infile, char *probname, int verbosity) in read_lp()
1458 void write_mip_desc_mps(MIPdesc *mip, char *fname) in write_mip_desc_mps()
1467 void write_mip_desc_lp(MIPdesc *mip, char *fname) in write_mip_desc_lp()
2266 int read_lp(MIPdesc *desc, char *infile, char *probname, int verbosity) in dual_simplex()
2275 void write_mip_desc_mps(MIPdesc *mip, char *fname) in dual_simplex()
2283 void write_mip_desc_lp(MIPdesc *mip, char *fname) in dual_simplex()
2368 MIPdesc *mip = lp_data->mip; in dual_simplex()
3643 int read_lp(MIPdesc *mip, char *infile, char *probname, int verbosity) in dual_simplex()
3754 void write_mip_desc_mps(MIPdesc *mip, char *fname) in dual_simplex()
[all …]
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/Master/ |
| H A D | cnrp_main.c | 557 env->mip = (MIPdesc *) calloc(1, sizeof(MIPdesc)); in cnrp_test()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/SPP/src/LP/ |
| H A D | spp_lp.c | 83 int user_create_subproblem(void *user, int *indices, MIPdesc *mip, in user_create_subproblem()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/MATCH/src/LP/ |
| H A D | user_lp.c | 55 int user_create_subproblem(void *user, int *indices, MIPdesc *mip, in user_create_subproblem()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/MPP/src/LP/ |
| H A D | mpp_lp.c | 55 int user_create_subproblem(void *user, int *indices, MIPdesc *mip, in user_create_subproblem()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/SPP+CUTS/src/LP/ |
| H A D | spp_lp.c | 87 int user_create_subproblem(void *user, int *indices, MIPdesc *mip, in user_create_subproblem()
|
| /dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Doc/ |
| H A D | man-lp.tex | 28 \paragraph{MIPdesc} paragraph
31 \firstfuncdef{MIPdesc}
33 \label{MIPdesc} label
36 with frequently is the \texttt{MIPdesc} data structure, which holds the data
262 int user_create_subproblem(void *user, int *indices, MIPdesc *mip,
280 out the \texttt{MIPdesc} data structure, described \hyperref{here}{in Section
281 }{}{MIPdesc}. The user is not responsible for allocating extra memory to allow
307 {\tt MIPdesc *mip} & OUT & Pointer to the MIPdesc data structure. \\
|