Generate an initial feasible solution by solving a linear programming with binary variables

1 |

`numVar` |
- number of variables |

`objVec` |
- objective function as a numeric vector |

`constraints` |
- a list of list of constraints with constr.mat, constr.dir, constr.rhs in each sublist |

a binary vector containing a feasible solution

1 | ```
#see documentation for sampl.mcmc
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.