Download List

项目描述

The GLPK package is intended for solving linear programming (LP) and mixed integer linear programming (MIP) problems. It is a set of routines organized in the form of a library and written in the ANSI C programming language.

系统要求

System requirement is not defined
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.

2003-06-25 23:19
4.0

此版本支持的GNU MathProg来建模语言(的AMPL建模语言的一个子集)。在“GLPK中:建模语言慈善MathProg来”的文件包括一个完整的GNU MathProg来描述。新版本支持glpsol的求解模型是用慈善MathProg来。在GLPK中/ L的建模语言是不再支持,因为GNU MathProg来完全取代所有GLPK的/ L的功能。
标签: Stable, Major feature enhancements
This release supports the GNU MathProg modeling language (a subset of the AMPL modeling language). The "GLPK: Modeling Language GNU MathProg" document included is a complete description of GNU MathProg. New glpsol solver version supporting models are written in GNU MathProg. The GLPK/L modeling language is no longer supported, as GNU MathProg completely supersedes all GLPK/L features.

2003-04-04 12:35
3.3

该唱片presolver现在使用的独立的程序默认情况下,和glpsol的是提供给lpx_simplex例程。在GLPK中/ L的语言,现在实现了区间套声明。还有现在GLPK的JNI的Java接口。
标签: Stable
The LP presolver is now used by default in the stand-alone program, and glpsol is provided to the lpx_simplex routine. The GLPK/L language now implements declarations of interval sets. There is also now a GLPK JNI Java interface.

2002-09-07 06:56
3.2.1

此版本包括对分支机构的初步实施和切框架,这是一种数据结构和解决拟例程混合整数和组合优化问题。这一框架是最好的描述“GLPK的:对科的初步实现和切削框架”文件。有一个独立的程序解决,最佳的目的,对称旅行商问题(TSP),这是一个经典的组合优化问题。
标签: Stable, Minor feature enhancements
This release includes a preliminary implementation of the branch-and-cut framework, which is a set of data structures and routines intended for solving mixed-integer and combinatorial optimization problems. That framework is best described in the "GLPK: A Preliminary Implementation of the Branch-and-Cut Framework" document. There is a standalone program intended for solving, optimally, the symmetric Travelling Salesman Problem (TSP), that is a classical problem of the combinatorial optimization.

2002-08-05 12:38
3.2

此版本包括新版本的GLPK的参考手册和“GLPK的:建模语言GLPK的/ L”文件。有几个新的API例程,以及独立glpsol的解算器的新版本(基于新的空气污染指数介乎3.0)开始实施。旧的API例程被拆除,因为新的API提供了从旧的API的所有功能。
标签: Stable, Major feature enhancements
This version includes new editions of the GLPK Reference Manual and the "GLPK: Modeling Language GLPK/L" document. There are several new API routines, and a new version of the standalone glpsol solver (based on the new API, from 3.0) was implemented. The old API routines were removed, as the new API provides all functions from the old API.

2002-06-18 00:48
3.1

新陆,分解和系统的维修保养程序(基于福雷斯特,汤姆林更新技术),新的参考手册和用户指南文档,一个新的单纯形法的执行情况。
标签: Stable, Major feature enhancements
New LU-factorization and basis maintenance routines (based on Forrest-Tomlin updating technique), new Reference Manual and User Guide documentation, and a new simplex method implementation.

Project Resources