LPSolve for Linux

What is lp_solve and what is it not? The simple answer is, lp_solve is a Mixed Integer Linear Programming (MILP) solver. And what is Linear Programming? See "What is Linear Programming?" and "Oh, and we also want to solve it as an integer program." for a Brief description. Also see Formulation of an lp problem in LPSolve. lp_solve is a free (see LGPL for the GNU lesser general public license) linear (integer) programming solver based on the revised SIMPLEX method and the Branch-and-bound method for the integers.It contains full source, examples and manuals.lp_solve solves Pure linear, (mixed) integer/binary, semi-continuous and special ordered sets (SOS) models. Note the word linear. This means that equations must be of the first order. 5 * x - 3 * y is an example. However x * y is not linear and cannot be handled by lp_solve. Both the objective function and the constraints have this restriction. Also see Ratios.Via the Branch-and-bound Algorithm, it can handle integer variables (see integer variables), semi-continuous variables (see semi-continuous variables) and Special Ordered Sets (see Special Ordered Sets (SOS)).