Skip to content
Sections
>> Trisquel >> Paketit >> etiona >> math >> lp-solve
etiona  ] [  nabia  ] [  aramo  ]
[ Source: lp-solve  ]

Paketti: lp-solve (5.5.0.15-4build1)

Links for lp-solve

lp-solve

Trisquel-palvelut:

Imuroi lähdekoodipaketti lp-solve:

Ylläpitäjä:

Original Maintainers:

  • Juan Esteban Monsalve Tobon
  • Rene Engelhard
  • Anibal Monsalve Salazar

External Resources:

Samankaltaisia paketteja:

Solve (mixed integer) linear programming problems

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.

Muut pakettiin lp-solve liittyvät paketit

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.11) [i386]
    GNU C Library: Shared libraries
    myös näennäispaketti, jonka toteuttaa libc6-udeb
    dep: libc6 (>= 2.14) [amd64]
  • dep: libcolamd2 (>= 4.5.2)
    column approximate minimum degree ordering library for sparse matrices

Imuroi lp-solve

Imurointi kaikille saataville arkkitehtuureille
Arkkitehtuuri Paketin koko Koko asennettuna Tiedostot
amd64 276.3 kt669 kt [tiedostoluettelo]
i386 295.4 kt743 kt [tiedostoluettelo]