The NetBSD Project

CVS log for pkgsrc/math/glpk/distinfo

[BACK] Up to [cvs.NetBSD.org] / pkgsrc / math / glpk

Request diff between arbitrary revisions


Default branch: MAIN


Revision 1.40 / (download) - annotate - [select for diffs], Mon Jul 8 16:28:16 2019 UTC (2 months, 2 weeks ago) by leot
Branch: MAIN
CVS Tags: HEAD
Changes since 1.39: +6 -6 lines
Diff to previous 1.39 (colored) to selected 1.37 (colored)

glpk: Update to 4.65

Changes:
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
  See doc/npp.txt for detailed description of these API routines.
- 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.

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). Thanks to David
  Monniaux <David.Monniaux@univ-grenoble-alpes.fr> for bug report
  and example model.
- The exact simplex solver routine was changed to perform
  terminal output according to the verbosity level (specified by
  the control parameter smcp.msg_lev). Thanks to Jeroen Demeyer
  <jdemeyer@cage.ugent.be> for bug report.
- A minor bug (related to MS Windows version) was fixed. Thanks
  to Heinrich Schuchardt <xypron.glpk@gmx.de> for bug report.
- An example model (Graceful Tree Labeling Problem) in MathProg
  was added. Thanks to Mike Appleby <mike@app.leby.org> for
  contribution.
- Three example models (Power plant LP scheduler, Neumann CA
  grid emulator generator) in MathProg and one in Cplex LP format
  were added. Thanks to Peter Naszvadi <vuk@cs.elte.hu> for
  contribution.

Discussed with <adam>, thanks!

Revision 1.39 / (download) - annotate - [select for diffs], Fri Aug 18 21:47:51 2017 UTC (2 years, 1 month ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2019Q2-base, pkgsrc-2019Q2, pkgsrc-2019Q1-base, pkgsrc-2019Q1, pkgsrc-2018Q4-base, pkgsrc-2018Q4, pkgsrc-2018Q3-base, pkgsrc-2018Q3, pkgsrc-2018Q2-base, pkgsrc-2018Q2, pkgsrc-2018Q1-base, pkgsrc-2018Q1, pkgsrc-2017Q4-base, pkgsrc-2017Q4, pkgsrc-2017Q3-base, pkgsrc-2017Q3, pkgsrc-
Changes since 1.38: +6 -6 lines
Diff to previous 1.38 (colored) to selected 1.37 (colored)

GLPK 4.63:

A "smart" LP perturbation was implemented in the primal and
dual simplex solvers. Now LP is perturbed only if it is
necessary, and by default perturbation is not activated.
The sum of primal infeasibilites that appears in the terminal
output of the primal simplex solver (as "inf = ...") now
corresponds to the original bounds of variables. This allows to
see how much perturbed solution violates the original bounds.

The long-step technique was implemented for phase I of the
primal simplex solver. This feature can be enabled by
specifying --flip option for glpsol or by specifying
glp_smcp.r_test = GLP_RT_FLIP on api level. For many LP
instances the long-step technique allows reducing the number
of simplex iterations to 30-70%. Please note that unlike the
dual simplex, where this technique can be used on both phase I
and II, for the primal simplex it can be used only on phase I,
where the sum of primal infeasibilities (which is a convex
piecewise linear function) is minimized.

An internal objective scaling was included in both primal and
dual simplex solvers. For many LP/MIP instances this feature
improves numerical stability (for the dual solver) and prevents
cycling near the optimum (for the primal solver).

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:
life_goe.mod (Conway's Game of Life garden of eden checker);
tiling.mod (Rectifiable polyomino tilings generator);
toto.mod (Covering code generator).

Revision 1.38 / (download) - annotate - [select for diffs], Wed Jan 25 10:02:16 2017 UTC (2 years, 7 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2017Q2-base, pkgsrc-2017Q2, pkgsrc-2017Q1-base, pkgsrc-2017Q1
Changes since 1.37: +6 -6 lines
Diff to previous 1.37 (colored)

GLPK 4.61 (42:0:2) has been released.

The following modules were renamed to simplify maintenance.
* src/prob.h     RENAMED            -> src/api/prob.h
* src/glpapi01.c RENAMED            -> src/api/prob1.c
* src/glpapi02.c RENAMED            -> src/api/prob2.c
* src/glpapi03.c RENAMED            -> src/api/prob3.c
* src/glpapi04.c RENAMED            -> src/api/prob4.c
* src/glpapi05.c RENAMED            -> src/api/prob5.c

* src/env/tls.c
TLS (thread local storage class specifier) option was added;
see comments in tls.c for details.

* configure.ac, config.h.in
Test for TLS was added.

* src/env/tls.c
Dll support was added.

The following modules were changed to add __cdecl specifier
for functions passed to qsort (this is needed only on compiling
GLPK with MSVC to run under MS Windows).
* src/api/cpxbas.c
* src/cglib/cfg1.c
* src/cglib/gmigen.c
* src/cglib/mirgen.c
* src/misc/wclique1.c
* src/simplex/spychuzc.c
* src/glpios10.c
* src/glpios11.c
* examples/glpsol.c

* src/glpk.h, src/env/env.c
The API routine glp_version was changed to avoid initialization
of the GLPK environment. The new API routine glp_config was
added (but not documented yet).

* INSTALL
Description of the configure option '--with-zlib' was removed.

Revision 1.37 / (download) - annotate - [selected], Tue Apr 12 21:40:47 2016 UTC (3 years, 5 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2016Q4-base, pkgsrc-2016Q4, pkgsrc-2016Q3-base, pkgsrc-2016Q3, pkgsrc-2016Q2-base, pkgsrc-2016Q2
Changes since 1.36: +6 -6 lines
Diff to previous 1.36 (colored)

GLPK 4.60:

Some improvements were made in the primal and dual simplex
solvers to make the solution process more numerically stable.

An experimental long-step ratio test feature was added to the
dual simplex. On API level this feature is available thru the
GLP_RT_FLIP option. For glpsol it is available thru the options
--flip (for MIP) or --flip and --dual (for LP). This feature is
not documented yet.

Additional check was added to reject wrong solutions sometimes
reported by the PROXY heuristic.

A bug (memory leak) was fixed in the FPUMP heuristic routine.

The header sql.h was renamed to avoid conflicts with standard
ODBC headers.

Revision 1.36 / (download) - annotate - [select for diffs], Fri Nov 27 21:00:28 2015 UTC (3 years, 9 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2016Q1-base, pkgsrc-2016Q1, pkgsrc-2015Q4-base, pkgsrc-2015Q4
Changes since 1.35: +6 -6 lines
Diff to previous 1.35 (colored) to selected 1.37 (colored)

Changes 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.

New API routine glp_at_error was added and documented.

Some minor typos were corrected in the GLPK documentation.

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.

Revision 1.35 / (download) - annotate - [select for diffs], Tue Nov 3 23:33:33 2015 UTC (3 years, 10 months ago) by agc
Branch: MAIN
Changes since 1.34: +2 -1 lines
Diff to previous 1.34 (colored) to selected 1.37 (colored)

Add SHA512 digests for distfiles for math category

Problems found locating distfiles:
	Package dfftpack: missing distfile dfftpack-20001209.tar.gz
	Package eispack: missing distfile eispack-20001130.tar.gz
	Package fftpack: missing distfile fftpack-20001130.tar.gz
	Package linpack: missing distfile linpack-20010510.tar.gz
	Package minpack: missing distfile minpack-20001130.tar.gz
	Package odepack: missing distfile odepack-20001130.tar.gz
	Package py-networkx: missing distfile networkx-1.10.tar.gz
	Package py-sympy: missing distfile sympy-0.7.6.1.tar.gz
	Package quadpack: missing distfile quadpack-20001130.tar.gz

Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden).  All existing
SHA1 digests retained for now as an audit trail.

Revision 1.34 / (download) - annotate - [select for diffs], Sat Aug 30 11:19:52 2014 UTC (5 years ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2015Q3-base, pkgsrc-2015Q3, pkgsrc-2015Q2-base, pkgsrc-2015Q2, pkgsrc-2015Q1-base, pkgsrc-2015Q1, pkgsrc-2014Q4-base, pkgsrc-2014Q4, pkgsrc-2014Q3-base, pkgsrc-2014Q3
Changes since 1.33: +5 -5 lines
Diff to previous 1.33 (colored) to selected 1.37 (colored)

Changes 4.55:
Some internal (non-API) routines to estimate the condition of
the basis matrix were added. These routines are mainly intended
to be used by the simplex-based solvers.

Two open modes "a" and "ab" were added to GLPK I/O routines.

Minor bug was fixed in the solver glpsol (command-line options
--btf, --cbg, and --cgr didn't work properly).

A serious bug was fixed in a basis factorization routine used
on the dense phase. (The bug might appear only if the number of
rows exceeded sqrt(2**31) ~= 46,340 and caused access violation
exception because of integer overflow.)

Two API routines glp_alloc and glp_realloc were documented.

Translation of the document "Modeling Language GNU MathProg"
to Spanish was included (in LaTeX and pdf formats).

Revision 1.33 / (download) - annotate - [select for diffs], Tue Apr 1 08:38:35 2014 UTC (5 years, 5 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2014Q2-base, pkgsrc-2014Q2
Changes since 1.32: +5 -5 lines
Diff to previous 1.32 (colored) to selected 1.37 (colored)

Changes 4.54:

Block-triangular LU-factorization was implemented to be used
on computing an initial factorization of the basis matrix.

A new version of the Schur-complement-based factorization
module was included in the package. Now it can be used along
with plain as well as with block-triangular LU-factorization.

Currently the following flags can be used to specify the type
of the basis matrix factorization (glp_bfcp.type):

GLP_BF_LUF + GLP_BF_FT   LUF, Forrest-Tomlin update (default)
GLP_BF_LUF + GLP_BF_BG   LUF, Schur complement, Bartels-Golub
                         update
GLP_BF_LUF + GLP_BF_GR   LUF, Schur complement, Givens rotation
                         update
GLP_BF_BTF + GLP_BF_BG   BTF, Schur complement, Bartels-Golub
                         update
GLP_BF_BTF + GLP_BF_GR   BTF, Schur complement, Givens rotation
                         update

In case of GLP_BF_FT the update is applied to matrix U, while
in cases of GLP_BF_BG and GLP_BF_GR the update is applied to
the Schur complement.

Corresponding new options --luf and --btf were added to glpsol.

For more details please see a new edition of the GLPK reference
manual included in the distribution.

A minor bug (in reporting the mip solution status) was fixed.

A call to "iodbc-config --cflags" was added in configure.ac
to correctly detect iodbc flags.

Revision 1.32 / (download) - annotate - [select for diffs], Fri Feb 14 09:25:49 2014 UTC (5 years, 7 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2014Q1-base, pkgsrc-2014Q1
Changes since 1.31: +5 -4 lines
Diff to previous 1.31 (colored) to selected 1.37 (colored)

Changes 4.53:
* The API routine glp_read_mps was changed to remove free rows.
* A bug was fixed in the API routine glp_read_lp.
* The zlib compression library used by some GLPK routines and
  included in the package was downgraded from 1.2.7 to 1.2.5 (as
  in GLPK 4.50) because of addressability bugs on some 64-bit
  platforms.
* A bug was fixed in a routine that reads gzipped files.
* Two API routines glp_get_it_cnt and glp_set_it_cnt were added.
* All obsolete GLPK API routines (prefixed with lpx) were removed
  from the package.
* A set of routines that simulate the old GLPK API (as defined
  in 4.48) were added; see examples/oldapi/api/lpx.c.
* A namespace bug was fixed in the SQL table drive module.

Revision 1.31 / (download) - annotate - [select for diffs], Wed Jul 31 07:02:35 2013 UTC (6 years, 1 month ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2013Q4-base, pkgsrc-2013Q4, pkgsrc-2013Q3-base, pkgsrc-2013Q3
Changes since 1.30: +4 -4 lines
Diff to previous 1.30 (colored) to selected 1.37 (colored)

GLPK 4.52.1 (release date: Jul 28, 2013)

        This is a bug-fix release.

        A version information bug in Makefile.am was fixed. Thanks to
        Sebastien Villemot <sebastien@debian.org> for bug report.

GLPK 4.52 (release date: Jul 18, 2013)

        The clique cut generator was essentially reimplemented, and now
        it is able to process very large and/or dense conflict graphs.

        A simple rounding heuristic was added to the MIP optimizer.

        Some bugs were fixed in the proximity search heuristic routine.
        Thanks to Giorgio Sartor <0gioker0@gmail.com>.

        New command-line option '--proxy [nnn]' was added to glpsol to
        enable using the proximity search heuristic.

        A bug (incorrect processing of LI column indicator) was fixed
        in the mps format reading routine. Thanks to Charles Brixko for
        bug report.

Revision 1.30 / (download) - annotate - [select for diffs], Tue Jul 2 10:17:37 2013 UTC (6 years, 2 months ago) by adam
Branch: MAIN
Changes since 1.29: +4 -4 lines
Diff to previous 1.29 (colored) to selected 1.37 (colored)

Changes 4.51:
Singleton and dense phases were implemented on computing
LU-factorization with Gaussian elimination. The singleton phase
is a feature that allows processing row and column singletons
on initial elimination steps more efficiently. The dense phase
is a feature used on final elimination steps when the active
submatrix becomes relatively dense. It significantly reduces
the time needed, especially if the active submatrix fits in CPU
cache, and improves numerical accuracy due to full pivoting.

The API routine glp_adv_basis that constructs advanced initial
LP basis was replaced by an improved version, which (unlike the
old version) takes into account numerical values of constraint
coefficients.

The proximity search heuristic for MIP was included in the GLPK
integer optimizer glp_intopt. On API level the heuristic can be
enabled by setting the parameter ps_heur in glp_iocp to GLP_ON.
This feature is also available in the solver glpsol through
command-line option '--proxy'.

A bug was fixed that caused numerical instability in the FPUMP
heuristic.

Revision 1.29 / (download) - annotate - [select for diffs], Wed May 29 20:08:08 2013 UTC (6 years, 3 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2013Q2-base, pkgsrc-2013Q2
Changes since 1.28: +4 -4 lines
Diff to previous 1.28 (colored) to selected 1.37 (colored)

Changes 4.50:
A new version of LU-factorization routines were added.
Currently this version provides the same functionality as the
old one, however, the new version allows further improving.

Old routines for FHV-factorization used to update the basis
factorization were replaced by a new version conforming to the
new version of LU-factorization.

Some clarifications about using the name index routines were
added.

Some typos were corrected in the MathProg language reference.

A serious bug (out-of-range indexing error) was *tentatively*
fixed in the routine glp_relax4. Unfortunatly, this bug is
inherited from the original Fortran version of the RELAX-IV
code (for details please see ChangeLog), and since the code is
very intricate, the bug is still under investigation.

Revision 1.28 / (download) - annotate - [select for diffs], Tue Apr 16 14:15:14 2013 UTC (6 years, 5 months ago) by adam
Branch: MAIN
Changes since 1.27: +4 -4 lines
Diff to previous 1.27 (colored) to selected 1.37 (colored)

GLPK 4.49 (release date: Apr 16, 2013)

        The new API routine glp_mincost_relax4, which is a driver to
        relaxation method of Bertsekas and Tseng (RELAX-IV), was added
        to the package. RELAX-IV is a code for solving minimum cost
        flow problems. On large instances it is 100-1000 times faster
        than the standard primal simplex method. Prof. Bertsekas, the
        author of the original RELAX-IV Fortran code, kindly permitted
        to include a C translation of his code in GLPK under GPLv3.

        A bug (wrong dual feasibility test) was fixed in API routine
        glp_warm_up. Thanks to David T. Price <dtprice@speakeasy.net>
        for bug report.

        Obsolete API routine lpx_check_kkt was replaced by new routine
        glp_check_kkt.

        IMPORTANT: All old API routines whose names begin with 'lpx_'
        were removed from API level and NO MORE AVAILABLE.

Revision 1.27 / (download) - annotate - [select for diffs], Thu Jan 31 20:31:28 2013 UTC (6 years, 7 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2013Q1-base, pkgsrc-2013Q1
Changes since 1.26: +4 -4 lines
Diff to previous 1.26 (colored) to selected 1.37 (colored)

Changes 4.48:
This is a maintainer release.
Some minor changes in API (glpk.h) were made. For details please see ChangeLog.
Some bugs/typos were fixed.

Revision 1.26 / (download) - annotate - [select for diffs], Wed Dec 7 18:52:22 2011 UTC (7 years, 9 months ago) by drochner
Branch: MAIN
CVS Tags: pkgsrc-2012Q4-base, pkgsrc-2012Q4, pkgsrc-2012Q3-base, pkgsrc-2012Q3, pkgsrc-2012Q2-base, pkgsrc-2012Q2, pkgsrc-2012Q1-base, pkgsrc-2012Q1, pkgsrc-2011Q4-base, pkgsrc-2011Q4
Changes since 1.25: +4 -4 lines
Diff to previous 1.25 (colored) to selected 1.37 (colored)

update to 4.47
changes:
-added API/options for Satisfiability problems
-minor bugfixes

Revision 1.25 / (download) - annotate - [select for diffs], Fri Dec 24 12:25:01 2010 UTC (8 years, 8 months ago) by asau
Branch: MAIN
CVS Tags: pkgsrc-2011Q3-base, pkgsrc-2011Q3, pkgsrc-2011Q2-base, pkgsrc-2011Q2, pkgsrc-2011Q1-base, pkgsrc-2011Q1, pkgsrc-2010Q4-base, pkgsrc-2010Q4
Changes since 1.24: +4 -4 lines
Diff to previous 1.24 (colored) to selected 1.37 (colored)

Update to GLPK 4.45, this is bug fix release.
While here, convert to MASTER_SITE_GNU and support TEST_TARGET.

Revision 1.24 / (download) - annotate - [select for diffs], Tue Jul 13 06:46:56 2010 UTC (9 years, 2 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2010Q3-base, pkgsrc-2010Q3
Changes since 1.23: +4 -4 lines
Diff to previous 1.23 (colored) to selected 1.37 (colored)

Changes 4.44:
The following suffixes for variables and constraints were
implemented in the MathProg language:

.lb     (lower bound),
.ub     (upper bound),
.status (status in the solution),
.val    (primal value), and
.dual   (dual value).

Now the MathProg language allows comment records (marked by
'#' in the very first position) in CSV data files read with the
table statements. Note that the comment records may appear only
in the beginning of a CSV data file.

The API routine glp_cpp to solve the Critical Path Problem was
added and documented.

Revision 1.23 / (download) - annotate - [select for diffs], Fri May 21 10:36:56 2010 UTC (9 years, 4 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2010Q2-base, pkgsrc-2010Q2
Changes since 1.22: +4 -4 lines
Diff to previous 1.22 (colored) to selected 1.37 (colored)

Changes 4.43:
* This is a maintainer release.
* `configure.ac' was changed to allow building the package under
  Mac OS and Darwin with ODBC support.
* The SQL table driver was improved to process NULL data.
* Some bugs were fixed in the LP/MIP preprocessor.

Changes 4.42:
* The new API routines were added.
* The new command-line options were added to the stand-alone solver glpsol.

Revision 1.22 / (download) - annotate - [select for diffs], Sat Jan 17 23:36:22 2009 UTC (10 years, 8 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2010Q1-base, pkgsrc-2010Q1, pkgsrc-2009Q4-base, pkgsrc-2009Q4, pkgsrc-2009Q3-base, pkgsrc-2009Q3, pkgsrc-2009Q2-base, pkgsrc-2009Q2, pkgsrc-2009Q1-base, pkgsrc-2009Q1
Changes since 1.21: +4 -4 lines
Diff to previous 1.21 (colored) to selected 1.37 (colored)

Changes 4.35:
* New API routines were added to the package.
* A minor change were made in the internal routine xputc.
* A minor bug was fixed in the internal routine mpl_fn_time2str.

Revision 1.21 / (download) - annotate - [select for diffs], Fri Dec 19 19:47:38 2008 UTC (10 years, 9 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2008Q4-base, pkgsrc-2008Q4
Changes since 1.20: +4 -4 lines
Diff to previous 1.20 (colored) to selected 1.37 (colored)

Changes 4.34:
* The GNU MathProg modeling language was supplemented with three
  new built-in functions:
	gmtime    obtaining current calendar time
	str2time  converting character string to calendar time
	time2str  converting calendar time to character string
* For detailed description of these functions see Appendix A in
  the document "Modeling Language GNU MathProg", a new edition of
  which was included in the distribution.
* A bug was fixed in the MIP solver.
* A new makefile was added to build the GLPK DLL with Microsoft
  Visual Studio Express 2008 for 64-bit Windows.

Revision 1.20 / (download) - annotate - [select for diffs], Fri Nov 7 20:01:29 2008 UTC (10 years, 10 months ago) by adam
Branch: MAIN
Changes since 1.19: +4 -4 lines
Diff to previous 1.19 (colored) to selected 1.37 (colored)

Changes 4.33:
* New API routines
* A crude implementation of CPLEX-like interface to GLPK API was
  added to the package. Currently it allows using GLPK as a core
  LP solver for Concorde, a well known computer code for solving
  the symmetric TSP.
* Some bugs were fixed in the SQL table driver.

Revision 1.19 / (download) - annotate - [select for diffs], Mon Oct 13 08:57:26 2008 UTC (10 years, 11 months ago) by adam
Branch: MAIN
Changes since 1.18: +4 -4 lines
Diff to previous 1.18 (colored) to selected 1.37 (colored)

Changes 4.32:

The following new features were included in the MIP solver
*  MIP presolver
*  mixed cover cut generator
*  clique cut generator
*  Euclidean reduction of the objective value

Due to changes the routine glp_intopt may additionally return
GLP_ENOPFS, GLP_ENODFS, and GLP_EMIPGAP.

The API routines lpx_integer are lpx_intopt are deprecated,
since they are completely superseded by glp_intopt.

The following new branch-and-cut API routines were added:
glp_ios_row_attr      determine additional row attributes
glp_ios_pool_size     determine current size of the cut pool
glp_ios_add_row       add constraint to the cut pool
glp_ios_del_row       delete constraint from the cut pool
glp_ios_clear_pool    delete all constraints from the cut pool

Revision 1.18 / (download) - annotate - [select for diffs], Mon Sep 8 07:15:01 2008 UTC (11 years ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2008Q3-base, pkgsrc-2008Q3, cube-native-xorg-base, cube-native-xorg
Changes since 1.17: +4 -4 lines
Diff to previous 1.17 (colored) to selected 1.37 (colored)

Changes 4.31:
* The core LP solver based on the dual simplex method was
  re-implemented and now it provides both phases I and II.

* New API routines.

* For description of these new routines see the reference manual
  included in the distribution.

* The following API routines are deprecated:
  lpx_scale_prob, lpx_std_basis, lpx_adv_basis, lpx_cpx_basis.

* Necessary changes were made in memory allocation routines to
  resolve portability issues for 64-bit platforms.

* New version of the routine lpx_write_pb to write problem data
  in OPB (pseudo boolean format) was added to the package.

* Two new makefiles were added to build the package for 32- and
  64-bit Windows with Microsoft Visual Studio Express 2008.

* Two new makefiles were added to build the package with Digital
  Mars C/C++ 8.50 and Open Watcom C/C++ 1.6 (for 32-bit Windows).

Revision 1.17 / (download) - annotate - [select for diffs], Wed Aug 20 08:19:13 2008 UTC (11 years, 1 month ago) by adam
Branch: MAIN
Changes since 1.16: +4 -4 lines
Diff to previous 1.16 (colored) to selected 1.37 (colored)

Changes 4.30:

* glpspx.h, glpspx03.c, glpapi06.c
  The primal simplex solver (spx_prim_opt, spx_prim_feas) was
  replaced by a new implementation (spx_primal), which currently
  provides the same features as the old version.

* glpmpl01.c, glpmpl03.c
  Some changes were made in the MathProg translator to allow <,
  <=, >=, and > on comparing symbolic values.

* glplpx10.c
  Internal routine set_d_eps in the exact LP solver was changed
  to prevent approximation errors in case of integral data.

Revision 1.16 / (download) - annotate - [select for diffs], Mon Apr 21 19:26:35 2008 UTC (11 years, 5 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2008Q2-base, pkgsrc-2008Q2, cwrapper
Changes since 1.15: +4 -4 lines
Diff to previous 1.15 (colored) to selected 1.37 (colored)

Changes 4.28:

The iODBC and MySQL table drivers, which allows transmitting
data between MathProg model objects and relational databases,
were re-implemented to replace a static linking by a dynamic
linking to corresponding shared libraries.
Many thanks to Heinrich Schuchardt <heinrich.schuchardt@gmx.de>
for the contribution, Rafael Laboissiere <rafael@debian.org>
for useful advices concerning the shared library support under
GNU/Linux, and Vijay Patil <vijay.patil@gmail.com> for testing
this feature under Windows XP.

A new optional feature was added to the package. This feature
is based on the zlib data compression library and allows GLPK
API routines and the stand-alone solver to read and write
compressed data files performing compression/decompression "on
the fly" (compressed data files are recognized by suffix `.gz'
in the file name). It may be useful in case of large MPS files
to save the disk space (up to ten times).

Revision 1.15 / (download) - annotate - [select for diffs], Sat Jan 5 21:58:07 2008 UTC (11 years, 8 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2008Q1-base, pkgsrc-2008Q1
Changes since 1.14: +4 -4 lines
Diff to previous 1.14 (colored) to selected 1.37 (colored)

Changes 4.25:
A tentative implementation of Gomory's mixed integer cuts was
included in the branch-and-cut solver. To enable generating
Gomory's cuts the control parameter gmi_cuts passed to the
routine glp_intopt should be set to GLP_ON. This feature is
also available in the solver glpsol through command-line option
'--gomory'. For more details please see the reference manual
included in the distribution.

Revision 1.14 / (download) - annotate - [select for diffs], Sun Nov 25 18:47:50 2007 UTC (11 years, 9 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2007Q4-base, pkgsrc-2007Q4
Changes since 1.13: +4 -4 lines
Diff to previous 1.13 (colored) to selected 1.37 (colored)

Changes 4.24:
A tentative implementation of MIR (mixed integer rounding) cuts
was included in the MIP solver. To enable generating MIR cuts
the control parameter mir_cuts passed to the routine glp_intopt
should be set to GLP_ON. This feature is also available in the
stand-alone solver glpsol via command-line option '--mir'. For
more details please see the reference manual included in the
distribution.

The implementation is mainly based on the following two papers:

1. H. Marchand and L. A. Wolsey. Aggregation and mixed integer
   rounding to solve MIPs. CORE discussion paper 9839, CORE,
   Universite catholique de Louvain, June 1998.

2. G. Andreello, A. Caprara, and M. Fischetti. Embedding cuts
   in a Branch&Cut framework. Preliminary draft, October 2003.

MIR cuts can be generated on any level of the search tree that
makes the GLPK MIP solver to be a real branch-and-cut solver.

A bug was fixed in the routine lpx_write_cpxlp. If a variable
x has upper bound and no lower bound, it should appear in the
bounds section as "-inf <= x <= u", not as "x <= u". Thanks to
Enric Rodriguez <erodri@lsi.upc.edu> for the bug report.

Revision 1.13 / (download) - annotate - [select for diffs], Mon Nov 12 19:38:15 2007 UTC (11 years, 10 months ago) by adam
Branch: MAIN
Changes since 1.12: +4 -4 lines
Diff to previous 1.12 (colored) to selected 1.37 (colored)

Changes 4.23:
The following new API routines were added:
glp_read_sol    read basic solution from text file
glp_write_sol   write basic solution to text file
glp_read_ipt    read interior-point solution from text file
glp_write_ipt   write interior-point solution to text file
glp_read_mip    read MIP solution from text file
glp_write_mip   write MIP solution to text file

Revision 1.12 / (download) - annotate - [select for diffs], Sat Oct 13 17:34:33 2007 UTC (11 years, 11 months ago) by adam
Branch: MAIN
Changes since 1.11: +4 -4 lines
Diff to previous 1.11 (colored) to selected 1.37 (colored)

Changes 4.22:
* Bug fixes

Revision 1.11 / (download) - annotate - [select for diffs], Sun Jul 1 08:12:13 2007 UTC (12 years, 2 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2007Q3-base, pkgsrc-2007Q3
Changes since 1.10: +4 -4 lines
Diff to previous 1.10 (colored) to selected 1.37 (colored)

Changes 4.18:
  The following new API routines were added:
  glp_set_rii        set (change) row scale factor
  glp_set_sjj        set (change) column scale factor
  glp_get_rii        retrieve row scale factor
  glp_get_sjj        retrieve column scale factor
  glp_simplex        solve LP problem with the simplex method
                     (this routine replaces lpx_simplex, which is
                      also available for backward compatibility)
  glp_init_smcp      initialize simplex method control params
  glp_bf_exists      check if the basis factorization exists
  glp_factorize      compute the basis factorization
  glp_bf_updated     check if the basis factorization has been
                     updated
  glp_get_bfcp       retrieve basis factorization control params
  glp_set_bfcp       change basis factorization control params
  glp_get_bhead      retrieve the basis header information
  glp_get_row_bind   retrieve row index in the basis header
  glp_get_col_bind   retrieve column index in the basis header
  glp_ftran          perform forward transformation
  glp_btran          perform backward transformation

Revision 1.10 / (download) - annotate - [select for diffs], Tue Feb 20 12:57:21 2007 UTC (12 years, 7 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2007Q2-base, pkgsrc-2007Q2, pkgsrc-2007Q1-base, pkgsrc-2007Q1
Changes since 1.9: +4 -6 lines
Diff to previous 1.9 (colored) to selected 1.37 (colored)

Chaneges 4.15:
 Autotools specification files (configure.ac, Makefile.am) were
 changed to use GNU Libtool. This allows building the static as
 well as shared GLPK library.

Changes 4.14:
 Now GLPK conforms to ILP32, LLP64, and LP64 programming models
 (the latter seems to be the ultimate choice regarding 64-bit
 architectures). Note that GLPK itself is a 32-bit application,
 and the conformity only means that the package works correctly
 on all these arenae. Nevertheless, on 64-bit platforms it is
 possible to use more than 4GB of memory, if necessary.

Revision 1.9 / (download) - annotate - [select for diffs], Thu Jan 4 22:38:49 2007 UTC (12 years, 8 months ago) by adam
Branch: MAIN
Changes since 1.8: +5 -5 lines
Diff to previous 1.8 (colored) to selected 1.37 (colored)

Changes 4.13:
        A tentative implementation of the "exact" simplex method based
        on bignum (rational) arithmetic was included in the package.

        On API level this new feature is available through the routine
        lpx_exact, which is similar to the routine lpx_simplex.

        In the solver glpsol this feature is available through two new
        command-line options: --exact and --xcheck. If the '--exact'
        option is specified, glpsol solves LP instance using the exact
        simplex method; in case of MIP it is used to obtain optimal
        solution of LP relaxation. If the --xcheck option is specified,
        LP instance (or LP relaxation) is solved using the standard
        (floating-point) simplex method, however, then glpsol calls the
        exact simplex routine to make sure that the final LP basis is
        exactly optimal, and if it is not, to perform some additional
        simplex iterations in exact arithmetic.

Changes 4.12:
        A tentative implementation of some simplex method routines
        based on exact (bignum) arithmetic was included in the package.
        Currently these routines provide computing LU-factorization of
        the basis matrix and computing components of basic solution.

        These routines were used to implement a routine, which checks
        primal and dual feasibility of basic solution exactly, i.e. in
        rational numbers, without round-off errors. In glpsol this
        feature is available through the command-line option --xcheck.

        GLPK has its own low-level routines implementing operations on
        integer and rational numbers that makes it independent on other
        software packages. However, to attain a much better performance
        it is highly recommended to install (before configuring GLPK)
        the GNU Multiple Precision Arithmetic Library (GMP). Using GMP
        makes computations 100-200 times faster.

Revision 1.8 / (download) - annotate - [select for diffs], Tue May 23 10:17:20 2006 UTC (13 years, 4 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2006Q4-base, pkgsrc-2006Q4, pkgsrc-2006Q3-base, pkgsrc-2006Q3, pkgsrc-2006Q2-base, pkgsrc-2006Q2
Changes since 1.7: +5 -5 lines
Diff to previous 1.7 (colored) to selected 1.37 (colored)

Changes 4.10:

Cutting planes of two new classes were implemented: mixed cover
cuts and clique cuts. On API level this feature can be enabled
by setting control parameter LPX_K_USECUTS passed to the routine
lpx_intopt. In glpsol this feature is available through the
command-line options --cover and --clique. For more details see
the reference manual.

Now the routines lpx_read_mps and lpx_read_freemps support LI
bound type. It is similar to LO, however, indicates the column
as of integer kind.

Revision 1.7 / (download) - annotate - [select for diffs], Sat Feb 4 11:54:51 2006 UTC (13 years, 7 months ago) by markd
Branch: MAIN
CVS Tags: pkgsrc-2006Q1-base, pkgsrc-2006Q1
Changes since 1.6: +5 -5 lines
Diff to previous 1.6 (colored) to selected 1.37 (colored)

Update glpk to 4.9

A MIP presolver were implemented (currently incomplete). It is
used internally in the routine lpx_intopt (see below).

An advanced branch-and-bound solver (the routine lpx_intopt)
were implemented.

The routine lpx_check_int to check MIP feasibility conditions
was added.

The routine lpx_print_mip was changed to print MIP feasibility
conditions.

The built-in functions sin, cos, atan, and atan2 were added to
the MathProg language.

Some typos were fixed.
Thanks to Minh Ha Duong <haduong@centre-cired.fr> (CIRED, CNRS).

Revision 1.6 / (download) - annotate - [select for diffs], Wed Mar 30 15:23:53 2005 UTC (14 years, 5 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2005Q4-base, pkgsrc-2005Q4, pkgsrc-2005Q3-base, pkgsrc-2005Q3, pkgsrc-2005Q2-base, pkgsrc-2005Q2
Changes since 1.5: +3 -1 lines
Diff to previous 1.5 (colored) to selected 1.37 (colored)

Rev.1: use LIBTOOL and build a shared library

Revision 1.5 / (download) - annotate - [select for diffs], Wed Feb 23 12:06:55 2005 UTC (14 years, 7 months ago) by agc
Branch: MAIN
CVS Tags: pkgsrc-2005Q1-base, pkgsrc-2005Q1
Changes since 1.4: +2 -1 lines
Diff to previous 1.4 (colored) to selected 1.37 (colored)

Add RMD160 digests in addition to SHA1 ones.

Revision 1.4 / (download) - annotate - [select for diffs], Fri Jan 14 11:31:00 2005 UTC (14 years, 8 months ago) by adam
Branch: MAIN
Changes since 1.3: +3 -3 lines
Diff to previous 1.3 (colored) to selected 1.37 (colored)

Changes 4.8:

        Core simplex method and interior-point method routines were
        re-implemented and now they use a new, "storage-by-rows" sparse
        matrix format (unlike previous versions where linked lists were
        used to represent sparse matrices). For details see ChangeLog.

        Also a minor bug was fixed in API routine lpx_read_cpxlp.

Revision 1.3 / (download) - annotate - [select for diffs], Tue Nov 30 15:58:39 2004 UTC (14 years, 9 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2004Q4-base, pkgsrc-2004Q4
Changes since 1.2: +3 -3 lines
Diff to previous 1.2 (colored) to selected 1.37 (colored)

Changes 4.7:
        Now GLPK supports free MPS format. Two new API routines
        lpx_read_freemps (to read problem data in free MPS format) and
        lpx_write_freemps (to write problem data in free MPS format)
        were added. This feature is also available in the solver glpsol
        via new command-line options --freemps and --wfreemps. For more
        details see the GLPK reference manual.

        API routines lpx_read_cpxlp and lpx_write_cpxlp for reading and
        writing problem data in CPLEX LP format were re-implemented to
        allow long symbolic names (up to 255 characters).

        The following three modules were temporarily removed from the
        GLPK distribution due to licensing problems: DELI (an interface
        module to Delphi), GLPKMEX (an interface module to Matlab), and
        JNI (an interface module to Java).

Revision 1.2 / (download) - annotate - [select for diffs], Tue Jul 2 12:58:45 2002 UTC (17 years, 2 months ago) by wiz
Branch: MAIN
CVS Tags: pkgviews-base, pkgviews, pkgsrc-2004Q3-base, pkgsrc-2004Q3, pkgsrc-2004Q2-base, pkgsrc-2004Q2, pkgsrc-2004Q1-base, pkgsrc-2004Q1, pkgsrc-2003Q4-base, pkgsrc-2003Q4, netbsd-1-6-RELEASE-base, netbsd-1-6-1-base, netbsd-1-6-1, netbsd-1-6
Changes since 1.1: +1 -0 lines
Diff to previous 1.1 (colored) to selected 1.37 (colored)

Add RCS Id.

Revision 1.1.1.1 / (download) - annotate - [select for diffs] (vendor branch), Wed Jun 26 15:30:39 2002 UTC (17 years, 2 months ago) by dmcmahill
Branch: TNF
CVS Tags: pkgsrc-base
Changes since 1.1: +0 -0 lines
Diff to previous 1.1 (colored) to selected 1.37 (colored)

import of glpk-3.0.7 provided in PR pkg/16691 by Kent Polk <kent@tiamat.goathill.org>
with some changes and finishing of the package by me.


GLPK is a set of routines written in ANSI C and organized in the form
of a callable library. This package is intended for solving large-scale
linear programming (LP), mixed integer linear programming (MIP), and
other related problems.

GLPK includes the following main components:

* implementation of the primal/dual simplex method;

* implementation of the primal-dual interior point method;

* implementation of the branch-and-bound procedure (based on the dual
  simplex method);

* application program interface (API);

* GLPK/L, a modeling language intended for writing LP/MIP models;

* GLPSOL, a stand-alone program intended for solving LP/MIP problems
  either prepared in the MPS format or written in the GLPK/L modeling
  language.

Revision 1.1 / (download) - annotate - [select for diffs], Wed Jun 26 15:30:39 2002 UTC (17 years, 2 months ago) by dmcmahill
Branch: MAIN
Diff to selected 1.37 (colored)

Initial revision

This form allows you to request diff's between any two revisions of a file. You may select a symbolic revision name using the selection box or you may type in a numeric name using the type-in text box.




CVSweb <webmaster@jp.NetBSD.org>