28ded8381e
* The following new API routines for LP/MIP preprocessing were added:
+ glp_npp_alloc_wksp allocate the preprocessor workspace
+ glp_npp_load_prob load original problem instance
+ glp_npp_preprocess1 perform basic LP/MIP preprocessing
+ glp_npp_build_prob build resultant problem instance
+ glp_npp_postprocess postprocess solution to resultant problem
+ glp_npp_obtain_sol obtain solution to original problem
+ glp_npp_free_wksp free the preprocessor workspace
* A new, more robust implementation of locally valid simple cover
cuts was included in the MIP solver.
* The API routine glp_init_iocp was changed to enable long-step
option of the dual simplex by default.
- Add glpk-no_random_return.patch
OBS-URL: https://build.opensuse.org/package/show/science/glpk?expand=0&rev=42
21 lines
699 B
Diff
21 lines
699 B
Diff
Index: glpk-4.65/src/draft/glpios01.c
|
|
===================================================================
|
|
--- glpk-4.65.orig/src/draft/glpios01.c
|
|
+++ glpk-4.65/src/draft/glpios01.c
|
|
@@ -1491,6 +1491,7 @@ int ios_add_row(glp_tree *tree, IOSPOOL
|
|
IOSCUT *ios_find_row(IOSPOOL *pool, int i)
|
|
{ /* find row (constraint) in the cut pool */
|
|
xassert(0);
|
|
+ return;
|
|
}
|
|
#else
|
|
IOSCUT *ios_find_row(IOSPOOL *pool, int i)
|
|
@@ -1550,6 +1551,7 @@ IOSCUT *ios_find_row(IOSPOOL *pool, int
|
|
void ios_del_row(glp_tree *tree, IOSPOOL *pool, int i)
|
|
{ /* remove row (constraint) from the cut pool */
|
|
xassert(0);
|
|
+ return;
|
|
}
|
|
#else
|
|
void ios_del_row(glp_tree *tree, IOSPOOL *pool, int i)
|