Knapsack Problems with Random Budgets
نویسندگان
چکیده
Given a set of elements, each having a profit and cost associated with it, and a budget, the 0-1 knapsack problem finds a subset of the elements with maximum possible combined profit subject to the combined cost not exceeding the budget. In this paper we study a stochastic version of the problem in which the budget is random. We propose two different formulations of this problem, based on different ways of handling infeasibilities, and propose exact and heuristic algorithms to solve the problems represented by these formulations. We also present the results from some computational experiments.
منابع مشابه
Financial Planning with 0 - 1 Knapsack Problems , Part I : Domination Results
The 0-1 knapsack problem provides an important model for financial planning. It is used to determine what subset of items provides the greatest return. Typically, it is used in situations such as budgeting, where there are only enough funds to sponsor a subset of projects. This paper provides results that allow us to determine when one project "dominates" another, that is, when some project is ...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملStochastic Knapsack Problems
In this paper we study and solve two different variants of static knapsack problems with random weights: The stochastic knapsack problem with simple recourse as well the stochastic knapsack problem with probabilistic constraint. Special regard is given the corresponding continuous problems and three different problem solving methods are presented. The resolution of the continuous problems serve...
متن کاملUpper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm
In this paper we study and solve two different variants of static knapsack problems with random weights: The stochastic knapsack problem with simple recourse as well as the stochastic knapsack problem with probabilistic constraint. Special interest is given to the corresponding continuous problems and three different problem solving methods are presented. The resolution of the continuous proble...
متن کاملDual Population Genetic Algorithm
The 0/1 Knapsack Problem is an optimization problem solved using various soft computing methods. The solution to the 0/1 Knapsack Problem (KP) can be viewed as the result of a sequence of decisions. Simple Genetic Algorithm (SGA) effectively solves knapsack problem for large data set. But it has problems like premature convergence and population diversity. Dual Population Genetic Algorithm (DPG...
متن کامل