Skip to content
Sections
>> Trisquel >> パッケージ >> nabia >> math >> lp-solve
etiona  ] [  nabia  ] [  aramo  ]
[ ソース: lp-solve  ]

パッケージ: lp-solve (5.5.0.15-4build1)

lp-solve に関するリンク

lp-solve

Trisquel の資源:

lp-solve ソースパッケージをダウンロード:

メンテナ:

Original Maintainers:

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

外部の資源:

類似のパッケージ:

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.

その他の lp-solve 関連パッケージ

  • 依存
  • 推奨
  • 提案
  • dep: libc6 (>= 2.11) [armhf]
    GNU C Library: Shared libraries
    以下のパッケージによって提供される仮想パッケージでもあります: libc6-udeb
    dep: libc6 (>= 2.14) [amd64]
  • dep: libcolamd2 (>= 4.5.2)
    column approximate minimum degree ordering library for sparse matrices

lp-solve のダウンロード

すべての利用可能アーキテクチャ向けのダウンロード
アーキテクチャ パッケージサイズ インストールサイズ ファイル
amd64 276.3 kB669 kB [ファイル一覧]
armhf 232.0 kB444 kB [ファイル一覧]