Generate Feasible Samples of a Knapsack Problem
![[R logo]](../../../doc/html/Rlogo.svg)
![[Up]](../../../doc/html/left.jpg)
![[Top]](../../../doc/html/up.jpg)
Documentation for package ‘KnapsackSampling’ version 0.1.0
Help Pages
| %[[% | Accessing the same named list elements of a list of lists |
| flip01 | Flip a 1 and a 0 simultaneously |
| initState | Generate an initial feasible solution by solving a linear programming with binary variables |
| sampl.mcmc | Generate feasible solutions to a knapsack problem using Markov Chain Monte Carlo |
| unlist.constr | Unpack constraints in a list of list into a matrix, equality or inequality signs, constant on right hand side |