|
|
10135.
|
|
|
log analyser with nice output written in Perl
|
|
|
Summary
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: logwatch
|
|
|
10136.
|
|
|
Logwatch is a modular log analyser that runs every night and mails you the results. It can also be run from command line.
|
|
|
Description
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: logwatch
|
|
|
10137.
|
|
|
The output is by service and you can limit the output to one particular service. The subscripts which are responsible for the output, mostly convert the raw log lines in structured format.
|
|
|
Description
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: logwatch
|
|
|
10138.
|
|
|
Logwatch generally ignores the time component in the output, that means, you will know that the reported event was logged in the requested range of time, but you will have to go to the raw log files to get the exact details.
|
|
|
Description
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: logwatch
|
|
|
10139.
|
|
|
Solve (mixed integer) linear programming problems
|
|
|
Summary
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: lp-solve
|
|
|
10140.
|
|
|
Solve (mixed integer) linear programming problems - documentation
|
|
|
Summary
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: lp-solve-doc
|
|
|
10141.
|
|
|
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.
|
|
|
Description
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: lp-solve-doc
Package: lp-solve
|
|
|
10142.
|
|
|
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.
|
|
|
Description
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: lp-solve-doc
Package: lp-solve
|
|
|
10143.
|
|
|
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.
|
|
|
Description
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: lp-solve-doc
Package: lp-solve
|
|
|
10144.
|
|
|
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
|
|
|
|
|
(no translation yet)
|
|
|
|
Located in
Package: lp-solve-doc
Package: lp-solve
|
