Description Usage Arguments Value Examples
crispLP
use the classic solver (simplex) to solve a crisp linear programming problem:
Max f(x) or Min f(x)
s.t.: Ax<=b
1 
objective 
A vector (c1, c2, …, cn) with the objective function coefficients f(x)=c1*x1+…+cn*xn. 
A 
Technological matrix of Real Numbers. 
dir 
Vector of strings with the direction of the inequalities, of the same length as 
b 
Vector with the right hand side of the constraints. 
maximum 

verbose 

crispLP
returns the solution if the solver has found it or NULL if not.
1 2 3 4 5 6 7 8 9 10 11 12 
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.