GNU Linear Programming Kit
The GLPK package is intended for solving large-scale linear programming, mixed integer programming, and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library.
- Developed at science
- Sources inherited from project openSUSE:Factory
-
5
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:zSystems/glpk && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| glpk-4.65.tar.gz | 0004167110 3.97 MB | |
| glpk-4.65.tar.gz.sig | 0000000065 65 Bytes | |
| glpk-no_random_return.patch | 0000000699 699 Bytes | |
| glpk.changes | 0000015058 14.7 KB | |
| glpk.keyring | 0000001351 1.32 KB | |
| glpk.spec | 0000003764 3.68 KB |
Revision 21 (latest revision is 26)
Dominique Leuenberger (dimstar_suse)
accepted
request 619409
from
Martin Pluskal (pluskalm)
(revision 21)
- Update to version 4.65:
* 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
Comments 0