>> help clp
clp Solve a LP or QP using clp
THIS IS A LOW LEVEL FUNCTION - USE opti_clp() INSTEAD!
clp uses the Coin-Or Linear Programming library.
[x,fval,exitflag,iter,lambda] = clp(H, f, A, rl, ru, lb, ub, opts)
Input arguments:
H - quadratic objective matrix (sparse, tril, optional)
f - linear objective vector
A - linear constraint matrix (sparse)
rl - linear constraint lhs
ru - linear constraint rhs
lb - decision variable lower bounds (optional)
ub - decision variable upper bounds (optional)
opts - solver options (see below)
Return arguments:
x - solution vector
fval - objective value at the solution
exitflag - exit status (see below)
iter - number of iterations taken by the solver
lambda - structure of dual information
Option Fields (all optional - see clpset):
algorithm - Solver algorithm (DualSimplex 0, PrimalSimplex 1, PrimalSimplexOrSprint 2, Barrier 3, BarrierNoCross 4, Automatic {5})
primalTol - Primal Tolerance
dualTol - Dual Tolerance
maxiter - maximum solver iterations
maxtime - maximum execution time [s]