kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/math/glpk/Makefile

19 lines
443 B
Makefile
Raw Normal View History

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-18 00:36:22 +01:00
# $NetBSD: Makefile,v 1.26 2009/01/17 23:36:22 adam Exp $
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 17:30:39 +02:00
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-18 00:36:22 +01:00
DISTNAME= glpk-4.35
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 17:30:39 +02:00
CATEGORIES= math
MASTER_SITES= ftp://ftp.gnu.org/gnu/glpk/
Rev.1: use LIBTOOL and build a shared library
2005-03-30 17:23:53 +02:00
MAINTAINER= adam@NetBSD.org
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 17:30:39 +02:00
HOMEPAGE= http://www.gnu.org/software/glpk/glpk.html
COMMENT should start with a capital letter.
2003-07-21 18:56:41 +02:00
COMMENT= Library for solving linear programming problems
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 17:30:39 +02:00
Add DESTDIR support.
2008-06-20 03:09:05 +02:00
PKG_DESTDIR_SUPPORT= user-destdir
Rev.1: use LIBTOOL and build a shared library
2005-03-30 17:23:53 +02:00
USE_LIBTOOL= yes
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 12:17:20 +02:00
USE_TOOLS+= gmake
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 16:58:39 +01:00
GNU_CONFIGURE= yes
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 17:30:39 +02:00
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 23:38:49 +01:00
.include "../../devel/gmp/buildlink3.mk"
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 17:30:39 +02:00
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink