Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: GNU Linear Programming Kit


Related Topics
GNU
GSL

In the News (Mon 28 Dec 09)

  
  Linear programming - Wikipedia, the free encyclopedia
In mathematics, linear programming (LP) problems are optimization problems in which the objective function and the constraints are all linear.
Linear programming problems must be converted into augmented form before being solved by the simplex algorithm.
In contrast to linear programming, which can be solved efficiently in the worst case, integer programming problems are in the worst case undecidable, and in many practical situations (those with bounded variables) NP-hard.
en.wikipedia.org /wiki/Linear_programming   (1417 words)

  
 GNU Linear Programming Kit - Wikipedia, the free encyclopedia
The GNU Linear Programming Kit (GLPK) is a software package intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems.
This package is released under the GNU General Public License.
GLPK uses the revised simplex method and the primal-dual interior point method for non-integer problems and the branch-and-bound algorithm together with Gomory's mixed integer cuts for (mixed) integer problems.
en.wikipedia.org /wiki/GLPK   (166 words)

  
 glpk-4.8 README   (Site not responding. Last check: 2007-10-17)
GLPK is part of the GNU Project released under the aegis of GNU.
GLPK is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version.
The GLPK package is a set of routines written in ANSI C and organized in the form of a callable library.
hpux.cs.utah.edu /hppd/hpux/Gnu/glpk-4.8/readme.html   (182 words)

  
 GNU's Who - GNU Project - Free Software Foundation (FSF)
David Sugar also founded the GNU Bayonne project and is one of the principle founder of OST, a commercial entity that develops and promotes free GPL licensed telephony solutions.
He co-authored the GNU font utilities, and is currently the volunteer maintainer of Texinfo and Hello, as well as contributing to Gnulib and co-leading the GNU Evaluation Team.
He is the principal author of the GNU C Library, co-author of the GNU Hurd, co-author of GNU Make, and a major contributor to GNU Autoconf.
www.gnu.org /people/people.html   (4376 words)

  
 Glpk for Windows   (Site not responding. Last check: 2007-10-17)
GLPK (GNU Linear Programming Kit) is intended for solving large scale linear programming problems by means of the revised simplex method.
It is a set of routines written in ANSI C and organized in the form of a library.
It is intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP), and other related problems.
gnuwin32.sourceforge.net /packages/glpk.htm   (139 words)

  
 [No title]
GLPK is not licensed under the Lesser General Public License (LGPL) as distinct from other free LP codes such as lp_solve.
A. Linear Programming is a mathematical technique that is a generic method for solving certain systems of equations with linear terms.
It may not be obvious that integer programming is a very much harder problem than ordinary linear programming, but that is nonetheless the case, in both theory and practice.
www.go.dlr.de:8081 /pdinfo_dv/glpk/GLPK_FAQ.txt   (2283 words)

  
 Links on Discrete Programming
GLPK (GNU Linear Programming Kit) package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems.
GLPK supports the GNU MathProg language, which is a subset of the AMPL language.
Zimpl is a little language to translate the mathematical model of a problem into a linear or (mixed-) integer mathematical program expressed in.
www.mat.univie.ac.at /~oleg/dplinks.html   (342 words)

  
 Linear Programming FAQ
These methods derive from techniques for nonlinear programming that were developed and popularized in the 1960s by Fiacco and McCormick, but their application to linear programming dates back only to Karmarkar's innovative analysis in 1984.
The network linear programming problem is to minimize the (linear) total cost of flows along all arcs of a network, subject to conservation of flow at each node, and upper and/or lower bounds on the flow along each arc.
This approach is based on a linear programming problem that decides how many rolls should be cut in each of several patterns, which means that fractional numbers of patterns may show up in the results.
www-unix.mcs.anl.gov /otc/Guide/faq/linear-programming-faq.html   (13600 words)

  
 Linear Programming FAQ
Linear and integer programming have proved valuable for modeling many and diverse types of problems in planning, routing, scheduling, assignment, and design.
GLPK (GNU Linear Programming Kit) is a C package that includes simplex (and also primal-dual interior point) methods for linear programming, a branch-and-bound implementation for integer programming, and a translator for the GNU MathProg language (a subset of
LPL is a mathematical modeling language for formulating and maintaining linear and mixed-integer programs.
www.freewebtown.com /lpsolve/LinearProgrammingFAQ.htm   (13244 words)

  
 GLPK - GNU Project - Free Software Foundation (FSF)
The GLPK documentation consists of the Reference Manual and the description of the GNU MathProg language.
Please remember that development of GLPK is a volunteer effort, and you can also contribute to its development.
The GLPK package is a part of the GNU project, released under the aegis of GNU.
www.gnu.org /software/glpk/glpk.html   (434 words)

  
 The OpenScience Project - Highest Rated Links
OOPSE is a new molecular dynamics simulation program which is capable of efficiently integrating equations of motion for atom types with orientational degrees of freedom (e.g.
JabRef is distributed under the terms of the Gnu General Public License, runs on all platforms and requires java 1.4.
GNU Octave is a high-level language, primarily intended for numerical computations.
www.openscience.org /top.php?order=rating   (1704 words)

  
 [No title]   (Site not responding. Last check: 2007-10-17)
GLPKMEX.M MEX Interface for the GNU GLPK library Copyright (C) 2001-2004, Nicolo' Giorgetti, Department of Information Engineering, University of Siena, Siena, Italy.
This file is part of GLPK (GNU Linear Programming Kit).
GLPK is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
plato.la.asu.edu /glpkmex/glpkmex.txt   (440 words)

  
 Computations   (Site not responding. Last check: 2007-10-17)
Description: The GNU bc arbitrary precision calculator language GNU bc is an interactive algebraic language with arbitrary precision which follows the POSIX 1003.2 draft standard, with several extensions including multi-character variable names, an `else' statement and full Boolean expressions.
An integer linear programming (ILP) problem is an LP with the constraint that all the variables are integers.
In a mixed integer linear programming (MILP) problem, some of the variables are integer and others are real.
linux.math.tifr.res.in /linux-manual/computations.html   (2125 words)

  
 Linux Links - The Linux Portal: Software/Programming/Libraries/Scientific
GNU Linear Programming Kit: a set of routines written in ANSI C and organized in the form of a library.
Similarly, the containers, adaptors, and iterators are used to represent and to manipulate concrete linear algebra objects such as matrices and vectors.
Emphasis is on the kind of operations needed in statistical calculations such as least squares, linear equation solve and eigenvalues.
www.linuxlinks.com /Software/Programming/Libraries/Scientific/index.shtml   (3424 words)

  
 LPInv: Linear-Programming Invariant Generator
There are numerous applications for this sort of invariant discovery in the traditional domains of program analysis and more recently in the non-traditional domain of reasoning about biological system models, and analyzing process models.
The project uses the PPL, GLPK and the GMP libraries at its core for which we are extremely grateful.
This project was partially funded by the NSF-EHS program (grant CCR-02-20134), by the NSF-ITR program (grant CCR-01-21403) and by the DARPA SEC program (ARPA/AF contract F33615-99-C-3014).
theory.stanford.edu /~srirams/Software/lpinv.html   (420 words)

  
 GLPK   (Site not responding. Last check: 2007-10-17)
It is a set of routines written in the ANSI C programming language and organized in the form of a library.
Licensed under The GNU General Public License, Version 2 or later.
Permission is granted to copy, distribute, and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts.
directory.fsf.org /glpk.html   (206 words)

  
 Solver Descriptions
The PATHNLP solver suitable is for NLP programs.
It minimizes a linear or nonlinear function subject to bounds on the variables and sparse linear or nonlinear constraints.
It is suitable for large-scale linear and quadratic programming and for linearly constrained optimization, as well as for general nonlinear programs.
www.gams.com /solvers/solvers.htm   (4222 words)

  
 Gnu
Time is a program that measures many of the CPU resources
This is the GNU release of uuencode and uudecode
GNU dbm is a set of database routines
hpux.connectisl.com /hppd/hpux/Gnu   (319 words)

  
 Linux Today - Release Digest: GNU, March 31, 2003
Programs that make heavy use of changing IGNORECASE should now be much faster, particularly if using a regular expression for FS or RS.
GLPK 3.3 -- Release Information ******************************* Release date: Mar 25, 2003 GLPK (GNU Linear Programming Kit) is intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP), and other related problems.
Now the API routine lpx_simplex (a driver to the simplex method) is provided with the built-in LP presolver, a program that transforms the original LP problem to an equivalent problem, which may be easier for solving with the simplex method than the original one.
www.linuxtoday.com /developer/2003040100826NWSWRL   (1993 words)

  
 Mathtools.net : C,C++/Optimization
This directory contains the sources to the Mixed Integer Linear Program solver 'lp_solve' in gzip-ed tar format: lp_solve.tar.gz This is the supported version, which is written in strict ANSI C, meant for UNIX and contains porting information for VMS.
Though mathematically simple, efficient linear algebra functions are particularly difficult to write, and unless written well, can consume thousands of wasted CPU cycles.
Linear programming library that incorporates the power of linear programming solver and simplicity of integration to any software tools like Ms Visual C++, Ms Visual Basic, Borland Delphi and other that support a DLL import.
www.mathtools.net /C_C__/Optimization   (812 words)

  
 Debian -- libglpk0
linear programming kit (shared libraries for use with Octave)
GLPK (GNU Linear Programming Kit) is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems.
This package was generated from the upstream sources patched to generate shared libraries, needed for linking against Octave version 2.9 and later.
packages.debian.org /testing/math/libglpk0   (111 words)

  
 The OpenScience Project
The simple answer is, lp_solve is a Mixed Integer Linear Programming (MILP) solver.
It is a free (see LGPL for the GNU lesser general public license) linear (integer) programming solver based on the revised simplex method and the Branch-and-bound method for the integers.
However x * y is not linear and cannot be handled by lp_solve.
www.openscience.org /links/index.php?section=107   (426 words)

  
 glpk - GNU Linear Programming Kit   (Site not responding. Last check: 2007-10-17)
GLPK is a set of routines written in ANSI C and organized in the form of a callable library.
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.
The library archive containing object code for all GLPK routines is "libglpk.a".
www.go.dlr.de /pdinfo_dv/glpk.html   (110 words)

  
 Section math - Debian Package: glpk   (Site not responding. Last check: 2007-10-17)
GLPK (GNU Linear Programming Kit) is a set of routines written in ANSI C and organized in the form of a library.
GLPK has the following main features: * implementation of the revised simplex method (based on sparse matrix technique, steepest edge pricing, and two-pass pivoting technique); * 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).
Included is a solver that reads problems in the standard MPS format, or in the GLPK/L modeling language.
www.mnis.fr /deb30/math/glpk.html   (109 words)

  
 Glop - The Generic Linear Optimization Package   (Site not responding. Last check: 2007-10-17)
Glop is copyright (C) 2002/3/4/5 François Galea and is published under the terms of the GNU Lesser General Public Licence.
The Generic Linear Optimization Package (Glop) is a library package that provides functions to create, manipulate and solve linear programs (LPs) in your C or C++ programs.
For example, the MIP (mixed integer programming) features of some of the available solvers are not available (for the moment).
www.prism.uvsq.fr /users/fgalea/glop.html   (285 words)

  
 GNU Linear Programming Kit - Tasks: Browse Items [Savannah]
GNU Linear Programming Kit - Tasks: Browse Items [Savannah]
GNU Linear Programming Kit - Tasks: Browse Items
Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved.
savannah.gnu.org /task?group=glpk   (57 words)

  
 ocaml-glpk - Solve large-scale linear programming (LP), mixed integer programming (MIP), and other related problems in ...
ocaml-glpk are OCaml bindings to GLPK (GNU Linear Programming Kit) which is a package intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems.
The library is released under the GPL license (like GLPK itself).
To compile this library you should have installed GLPK first.
ocaml-glpk.sourceforge.net   (112 words)

  
 Julien Thénié english version   (Site not responding. Last check: 2007-10-17)
Vial, Stochastic Programming with linear Decision Rules, an application to the evaluation of option contracts, 10th International Conference on Stochastic Programming, Tucson, AZ, USA, October 9-15, 2004.
Vial, Stochastic Programming with linear Decision Rules, an application to the evaluation of option contracts, FRANCORO IV, Fribourg, Switzerland, August 19-21, 2004.
A free web interface to transform a deterministic problem formulated in MathProg (a subset of Ampl, part of the GNU Linear Programming Kit) to its deterministic equivalent (stochastic version of the problem).
hec.info.unige.ch /thenie/indexEN.html   (326 words)

  
 Free Software Directory: Software Libraries
GLPK - [The GNU General Public License, Version 2 or later] - 2005-01-12 00:00:00.000
GNU lightning - [The GNU General Public License, Version 2 or later] - 2005-05-23 00:00:00.000
GNU SASL - [GPLv2orlater, LGPLv2.1orlater] - 2005-10-23 00:00:00.000
directory.fsf.org /libs   (496 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.