On The Characteristics of the Optimal Solutions to a Stochastic Knapsack Problem with Contagious Distributional Capacity
Problems involving different parameters of the knapsack problem has been studied over the years stochastically using different methods. This involves obtaining optimal solutions to these problem when the parameters follows a particular distribution. However, the characteristics of these distributions and their effect on the solutions have not been investigated. This study therefore investigates the stochastic knapsack problem with the capacity following a contagious distribution of Poisson and Gamma distributions. Using the simplex method of Witchakul et al. (2007), an exact algorithm was developed and the characteristics of the mixture also examined and compared with the algorithm of Witchakul et al. (2007). The result indicates that the characteristics of a mixture in a stochastic knapsack problem affects the optimal solutions of the problem.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.