Skip to content
Sections
>> Trisquel >> Paket >> aramo >> math >> lp-solve
etiona  ] [  nabia  ] [  aramo  ]
[ Källkod: lp-solve  ]

Paket: lp-solve (5.5.2.5-2build2)

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.

Andra paket besläktade med lp-solve

  • beror
  • rekommenderar
  • föreslår
  • dep: libc6 (>= 2.34)
    GNU C Library: Shared libraries
    också ett virtuellt paket som tillhandahålls av libc6-udeb
  • dep: libcolamd2 (>= 1:4.5.2)
    column approximate minimum degree ordering library for sparse matrices

Hämta lp-solve

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Paketstorlek Installerad storlek Filer
ppc64el 349,6 kbyte888 kbyte [filförteckning]