出版社：Japan Society for Fuzzy Theory and Intelligent Informatics
摘要：In this paper, we consider a continuous type knapsack problem involving fuzzy random variable coefficients. First, we formulate the problem to maximize a degree of possibility that the objective function value satisfies a fuzzy goal. Since the degree of possibility varies randomly, we consider the model based on the fractile optimization model in stochastic programming. After transforming the problem into the deterministic equivalent problem, we propose a polynomial order algorithm for solving the problem efficiently and obtain the time complexity.
关键词：Knapsack Problem ; Fuzzy Random Variable ; Possibility Measure ; Stochastic Program ; Polynomial Order Algorithm
