ldp | R Documentation |

Solve least distance programming: find x satisfying `u%*%x >= co`

and s.t. min(||x||)
by passing to nnls (non negative least square) problem.

```
ldp(u, co, rcond = 1e+10)
```

`u` |
a dense matrix of inequality constraints |

`co` |
a right hand side vector of inequality constraints |

`rcond` |
maximal condition number for determining rank deficient matrix |

solution vector or NULL if constraints are unfeasible

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.