SPECS: lp_solve.spec - longer description from debian

glen glen at pld-linux.org
Mon Mar 26 23:53:46 CEST 2007


Author: glen                         Date: Mon Mar 26 21:53:46 2007 GMT
Module: SPECS                         Tag: HEAD
---- Log message:
- longer description from debian

---- Files affected:
SPECS:
   lp_solve.spec (1.10 -> 1.11) 

---- Diffs:

================================================================
Index: SPECS/lp_solve.spec
diff -u SPECS/lp_solve.spec:1.10 SPECS/lp_solve.spec:1.11
--- SPECS/lp_solve.spec:1.10	Mon Mar 26 23:40:12 2007
+++ SPECS/lp_solve.spec	Mon Mar 26 23:53:41 2007
@@ -7,7 +7,7 @@
 Summary(pl.UTF-8):	Biblioteka i narzędzie do rozwiązywania problemu programowania liniowego
 Name:		lp_solve
 Version:	%{_ver_major}.%{_ver_minor}
-Release:	0.1
+Release:	0.3
 License:	LGPL
 Group:		Libraries
 Source0:	http://dl.sourceforge.net/lpsolve/%{name}_%{version}_source.tar.gz
@@ -20,9 +20,26 @@
 BuildRoot:	%{tmpdir}/%{name}-%{version}-root-%(id -u -n)
 
 %description
-Mixed Integer Linear Programming (MILP) solver lp_solve solves pure
-linear, (mixed) integer/binary, semi-continuous and special ordered
-sets (SOS) models.
+The linear programming (LP) problem can be formulated as: Solve A.x >=
+V1, with V2.x maximal. A is a matrix, x is a vector of (nonnegative)
+variables, V1 is a vector called the right hand side, and V2 is a
+vector specifying the objective function.
+
+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.
+
+The program lp_solve solves LP, ILP, and MILP problems. It is slightly
+more general than suggested above, in that every row of A (specifying
+one constraint) can have its own (in)equality, <=, >= or =. The result
+specifies values for all variables.
+
+lp_solve uses the 'Simplex' algorithm and sparse matrix methods for
+pure LP problems. If one or more of the variables is declared integer,
+the Simplex algorithm is iterated with a branch and bound algorithm,
+until the desired optimal solution is found. lp_solve can read MPS
+format input files.
 
 %description -l pl.UTF-8
 Biblioteka i narzędzie do rozwiązywania problemu programowania
@@ -97,6 +114,9 @@
 All persons listed below can be reached at <cvs_login>@pld-linux.org
 
 $Log$
+Revision 1.11  2007/03/26 21:53:41  glen
+- longer description from debian
+
 Revision 1.10  2007/03/26 21:40:12  glen
 - update to 5.5.0.10
 
================================================================

---- CVS-web:
    http://cvs.pld-linux.org/SPECS/lp_solve.spec?r1=1.10&r2=1.11&f=u



More information about the pld-cvs-commit mailing list