KnapsackSampling: Generate Feasible Samples of a Knapsack Problem

Share:

The sampl.mcmc() function creates samples of the feasible region of a knapsack problem with both equalities and inequalities constraints.

Author
Chin Soon Lim [aut]
Date of publication
2016-10-16 15:13:33
Maintainer
Chin Soon Lim <chinsoon12@hotmail.com>
License
GPL (>= 2) | file LICENSE
Version
0.1.0
URLs

View on CRAN

Man pages

flip01
Flip a 1 and a 0 simultaneously
grapes-sub-sub-grapes
Accessing the same named list elements of a list of lists
initState
Generate an initial feasible solution by solving a linear...
sampl.mcmc
Generate feasible solutions to a knapsack problem using...
unlist.constr
Unpack constraints in a list of list into a matrix, equality...

Files in this package

KnapsackSampling
KnapsackSampling/NAMESPACE
KnapsackSampling/R
KnapsackSampling/R/knapsackSampling.R
KnapsackSampling/MD5
KnapsackSampling/DESCRIPTION
KnapsackSampling/man
KnapsackSampling/man/grapes-sub-sub-grapes.Rd
KnapsackSampling/man/initState.Rd
KnapsackSampling/man/unlist.constr.Rd
KnapsackSampling/man/sampl.mcmc.Rd
KnapsackSampling/man/flip01.Rd
KnapsackSampling/LICENSE