Get the latest news, exclusives, sport, celebrities, showbiz, politics, business and lifestyle from The VeryTime,Stay informed and read the latest news today from The VeryTime, the definitive source.

lp-solve

26
Definition: lp-solve: 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 a vector of (nonnegative) variables, V1 a vector called the right hand side, and V2 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.

.................................
Source: Debian 3.0r0 APT / Linux Dictionary V 0.16
http://www.tldp.org/LDP/Linux-Dictionary/html/index.html
Author: Binh Nguyen linuxfilesystem(at)yahoo(dot)com(dot)au
.................................

> Linux/Unix/Computing Glossary
Source...
Subscribe to our newsletter
Sign up here to get the latest news, updates and special offers delivered directly to your inbox.
You can unsubscribe at any time

Leave A Reply

Your email address will not be published.