Smoothconcave¶
- SparseLP_old(c, polyhedron, zeps, max_warm_start)[source]¶
Compute the sparsest solution of a linear program (LP) min c’x s.t. Sx=b
lb <= x <= ub
- findMinimalSetOfRxns(model)[source]¶
This function finds the minimal set of reactions subject to a LP objective function \(min ||x||_0\) \(min c'x\) s.t. \(Sx = b\) \(lb <= x <= ub\)
- USAGE
[result_tab, sol, lprxns, l1rxns, l0rxns] = findMinimalSetOfRxns (model)
- INPUT
model – COBRA model structure
- OUTPUTS
resutl_tab – number of reactions obtained for each condition
sol – x - solution vector
lprxns – rxns indices for LP solution
l1rxns – rxns indices for L1 solution
l0rxns – rxns indices for L0 solution