Commit graph

33 commits

Author SHA1 Message Date
joerg
2d1ba244e9 Simply and speed up buildlink3.mk files and processing.
This changes the buildlink3.mk files to use an include guard for the
recursive include. The use of BUILDLINK_DEPTH, BUILDLINK_DEPENDS,
BUILDLINK_PACKAGES and BUILDLINK_ORDER is handled by a single new
variable BUILDLINK_TREE. Each buildlink3.mk file adds a pair of
enter/exit marker, which can be used to reconstruct the tree and
to determine first level includes. Avoiding := for large variables
(BUILDLINK_ORDER) speeds up parse time as += has linear complexity.
The include guard reduces system time by avoiding reading files over and
over again. For complex packages this reduces both %user and %sys time to
half of the former time.
2009-03-20 19:23:50 +00:00
adam
a73e809cc1 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.
2009-01-17 23:36:22 +00:00
adam
1c894005a1 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.
2008-12-19 19:47:38 +00:00
adam
b24b44f4d0 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.
2008-11-07 20:01:29 +00:00
adam
5d55a849cc 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
2008-10-13 08:57:26 +00:00
adam
f8c3caa094 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).
2008-09-08 07:15:01 +00:00
adam
b4580806e2 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.
2008-08-20 08:19:13 +00:00
joerg
3b0d97b0de Add DESTDIR support. 2008-06-20 01:09:05 +00:00
adam
3ed95e5ae7 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).
2008-04-21 19:26:35 +00:00
adam
f7a72a847e 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.
2008-01-05 21:58:07 +00:00
adam
49b0466c99 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.
2007-11-25 18:47:50 +00:00
adam
33ee62633c 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
2007-11-12 19:38:15 +00:00
adam
7ecc5bd860 Changes 4.22:
* Bug fixes
2007-10-13 17:34:33 +00:00
adam
6b05ff786a 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
2007-07-01 08:12:13 +00:00
adam
897b74d488 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.
2007-02-20 12:57:21 +00:00
adam
7f6d84b51a 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.
2007-01-04 22:38:49 +00:00
jlam
c16221a4db Change the format of BUILDLINK_ORDER to contain depth information as well,
and add a new helper target and script, "show-buildlink3", that outputs
a listing of the buildlink3.mk files included as well as the depth at
which they are included.

For example, "make show-buildlink3" in fonts/Xft2 displays:

	zlib
	fontconfig
	    iconv
	    zlib
	    freetype2
	    expat
	freetype2
	Xrender
	    renderproto
2006-07-08 23:10:35 +00:00
jlam
9430e49307 Track information in a new variable BUILDLINK_ORDER that informs us
of the order in which buildlink3.mk files are (recursively) included
by a package Makefile.
2006-07-08 22:38:58 +00:00
adam
33e2f17ddf 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.
2006-05-23 10:17:20 +00:00
rillig
96fc47c14f Aligned the last line of the buildlink3.mk files with the first line, so
that they look nicer.
2006-04-12 10:26:59 +00:00
reed
5abef9be14 Over 1200 files touched but no revisions bumped :)
RECOMMENDED is removed. It becomes ABI_DEPENDS.

BUILDLINK_RECOMMENDED.foo becomes BUILDLINK_ABI_DEPENDS.foo.

BUILDLINK_DEPENDS.foo becomes BUILDLINK_API_DEPENDS.foo.

BUILDLINK_DEPENDS does not change.

IGNORE_RECOMMENDED (which defaulted to "no") becomes USE_ABI_DEPENDS
which defaults to "yes".

Added to obsolete.mk checking for IGNORE_RECOMMENDED.

I did not manually go through and fix any aesthetic tab/spacing issues.

I have tested the above patch on DragonFly building and packaging
subversion and pkglint and their many dependencies.

I have also tested USE_ABI_DEPENDS=no on my NetBSD workstation (where I
have used IGNORE_RECOMMENDED for a long time). I have been an active user
of IGNORE_RECOMMENDED since it was available.

As suggested, I removed the documentation sentences suggesting bumping for
"security" issues.

As discussed on tech-pkg.

I will commit to revbump, pkglint, pkg_install, createbuildlink separately.

Note that if you use wip, it will fail!  I will commit to pkgsrc-wip
later (within day).
2006-04-06 06:21:32 +00:00
joerg
5911def816 Recursive revision bump / recommended bump for gettext ABI change. 2006-02-05 23:08:03 +00:00
markd
2d578db944 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).
2006-02-04 11:54:51 +00:00
jlam
585534220c Remove USE_GNU_TOOLS and replace with the correct USE_TOOLS definitions:
USE_GNU_TOOLS	-> USE_TOOLS
	awk		-> gawk
	m4		-> gm4
	make		-> gmake
	sed		-> gsed
	yacc		-> bison
2005-05-22 20:07:36 +00:00
adam
1238bb8e48 Rev.1: use LIBTOOL and build a shared library 2005-03-30 15:23:53 +00:00
agc
1e46c076aa Add RMD160 digests in addition to SHA1 ones. 2005-02-23 12:06:53 +00:00
adam
d1111b4565 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.
2005-01-14 11:31:00 +00:00
adam
14325ea8b6 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).
2004-11-30 15:58:39 +00:00
martti
f928be280d COMMENT should start with a capital letter. 2003-07-21 16:56:41 +00:00
grant
0155927c43 s/netbsd.org/NetBSD.org/ 2003-07-17 21:41:05 +00:00
jschauma
e366d0c694 Use tech-pkg@ in favor of packages@ as MAINTAINER for orphaned packages.
Should anybody feel like they could be the maintainer for any of thewe packages,
please adjust.
2003-06-02 01:15:31 +00:00
wiz
1a4485ab32 Add RCS Id. 2002-07-02 12:56:53 +00:00
dmcmahill
ff73294c77 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.
2002-06-26 15:30:39 +00:00