Skip to content
Sections
>> Trisquel >> Пакети >> nabia >> doc >> lp-solve-doc
etiona  ] [  nabia  ] [  aramo  ]
[ Източник: lp-solve  ]

Пакет: lp-solve-doc (5.5.0.15-4build1)

Връзки за lp-solve-doc

lp-solve-doc

Ресурси за Trisquel:

Изтегляне на пакет-източник lp-solve.

Отговорник:

Original Maintainers:

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

Външни препратки:

Подобни пакети:

Solve (mixed integer) linear programming problems - documentation

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.

This package contains the documentation for the lp_solve program and the library.

Други пакети, свързани с lp-solve-doc

  • зависимости
  • препоръчани
  • предложени

Изтегляне на lp-solve-doc

Изтегляне за всички налични архитектури
Архитектура Големина на пакета Големина след инсталиране Файлове
all 1 010,9 кБ4492 кБ [списък на файловете]