Index index by Group index by Distribution index by Vendor index by creation date index by Name Mirrors Help Search

libglpk40-5.0-bp153.1.1 RPM for armv7hl

From OpenSuSE Ports Leap 15.3 for armv7hl

Name: libglpk40 Distribution: SUSE Linux Enterprise 15 SP3
Version: 5.0 Vendor: openSUSE
Release: bp153.1.1 Build date: Thu Apr 8 11:50:03 2021
Group: System/Libraries Build host: armbuild01
Size: 1359912 Source RPM: glpk-5.0-bp153.1.1.src.rpm
Summary: 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.






* Thu Jan 21 2021 Luigi Baldoni <>
  - Update to version 5.0
    * The copyright was transferred to the Free Software Foundation.
    * To fix some licensing problems the routines in the following
      files were disabled by replacing with dummy ones that print an
      error message:
      + src/api/gridgen.c
      + src/api/netgen.c
      + src/api/rmfgen.c
      + src/misc/qmd.c
      + src/misc/relax4.c
      + Note that this change does not affect the main functionality
      of the package.
    * Some minor bugs were fixed.
  - Added pkgconfig file
* Mon Feb 03 2020 Martin Pluskal <>
  - Enable PGO during build
* Sat Oct 12 2019 Stefan BrĂ¼ns <>
  - Fix glpk-no_random_return.patch to return a value for a non-void
* Fri Dec 21 2018 Martin Pluskal <>
  - Small packaging change for doc subpackage
  - Enable additional functionality
* Wed Jun 27 2018
  - 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
* Mon Dec 11 2017
  - update to 4.64:
    * The dual simplex solver routine was changed to perform more
      aggressive perturbation to prevent dual degeneracy and avoid
      stalling even if the current dual basic solution is strongly
      feasible (mainly if the objective is zero)
    * The exact simplex solver routine was changed to perform
      terminal output according to the verbosity level (specified by
      the control parameter smcp.msg_lev)
    * A minor bug (related to MS Windows version) was fixed
    * An example model (Graceful Tree Labeling Problem) in MathProg
      was added
    * Three example models (Power plant LP scheduler, Neumann CA
      grid emulator generator) in MathProg and one in Cplex LP format
      were added
* Mon Jul 31 2017
  - Update to version 4.63:
    * A "smart" LP perturbation was implemented in the primal and
      dual simplex solvers.
    * The long-step technique was implemented for phase I of the
      primal simplex solver.
    * An internal objective scaling was included in both primal and
      ual simplex solvers.
    * The Posix version of glp_time (glpk/src/env/time.c) was changed
      to resolve time_t issue on msys2.
    * Three new example models in MathProg were added.
    * Changes for version 4.62:
    * The bound perturbation technique was included in the primal
      simplex solver to improve numerical stability and avoid
    * A range bug was fixed in the MPS reading routine.
    * Changes were made to provide 64-bit portability of the Minisat
    * Calls to non-thread-safe functions gmtime, strerror, and strtok
      were replaced by calls to corresponding thread-safe equivalents
* Mon Jan 23 2017
  - Update to version 4.61:
    * An option was added to build a re-entrant version of the
      package suitable for running in a multi-threaded environment.
    * A re-entrant version of the package allows running multiple
      independent instances of glpk in different threads of a
      multi-threaded application.
  - Use savannah as source for gpg keyring
* Fri Apr 01 2016
  - Update to 4.60
    * src/glpk.h Declarations of all non-documented API routines were
      hidden by #ifdef GLP_UNDOC / #endif.
    * src/simplex/spydual.c An experimental feature (objective
      coefficient perturbation) to improve numerical stabilty and
      avoid cycling was included in the dual simplex solver.
  - Enable gmp support
* Sun Mar 13 2016
  - Update to 4.59
    * Some bugs were fixed and some improvements were made in the
      MIP solver.
    * The data file format used by API routines glp_read_graph and
      glp_write_graph was changed. For more details please see the
      document "GLPK: Graph and Network Routines" included in the
    * Translation of the document "Modeling Language GNU MathProg"
      to Brazilian Portuguese (pt-BR) was included (in LaTeX and pdf
* Fri Feb 19 2016
  - Update to 4.58
    * The solution file format used by API routines glp_read_sol,
      glp_write_sol, glp_read_ipt, glp_write_ipt, glp_read_mip, and
      glp_write_mip was changed. For more details please see the GLPK
      reference manual included in the distribution.
    * The tan function (trigonometric tangent) was added to GNU
      MathProg modeling language.
    * A new version of the document "Modeling Language GNU MathProg"
      in Spanish was included (in LaTeX and pdf formats).
    * A check to determine if libtool needs '-no-undefined' flag to
      build shared libraries on some platforms was added.
    * A script to regenerate the configure script and the Makefiles
      was added.
* Sun Nov 08 2015
  - Update to 4.57
    * A new, more efficient implementation of the dual simplex method
    was included in the package. This new implementation replaces
    the old one, which was removed.
    * Option sr_heur was added to struct glp_iocp to enable/disable
    the simple rounding heuristic used by the MIP solver. Thanks to
    Chris Matrakidis <> for suggestion.
    * New API routine glp_at_error was added and documented. Thanks
    to Jeroen Demeyer <> for suggestion.
    * Some minor typos were corrected in the GLPK documentation.
    Thanks to Anton Voropaev <> for typo
    * An example application program TSPSOL was added. It uses the
    GLPK MIP optimizer to solve the Symmetric Traveling Salesman
    Problem and illustrates "lazy" constraints generation. For more
    details please see glpk/examples/tsp/README.
* Fri Oct 02 2015
  - Update to 4.56
    * A new, more efficient and more robust implementation of the
      primal simplex method was included in the package. This new
      implementation replaces the old one, which was removed.
    * A bug was fixed in a basis factorization routine. (The bug
      appeared if the basis matrix was structurally singular having
      duplicate row and/or column singletons.) Thanks to Martin Jacob
    * Scripts to build GLPK with Microsoft Visual Studio 2015 were
      added. Thanks to Xypron <> for contribution
      and testing.
  - Cleanup spec file with spec-clener
* Wed Nov 12 2014
  - Update to version 4.55
    * Bugfixes, documentation update. See NEWS file for details.



Generated by rpm2html 1.8.1

Fabrice Bellet, Mon May 9 20:55:56 2022