Wine in Your Knapsack?
We pose three Knapsack Problems (KPs) to select the rank-maximizing subset of wines subject to budget and quantity constraints. The first problem seeks the subset of wines, from a single cultivar (zinfandel) that maximizes the sum of rank subject to a budget constraint. We modify this problem by adding an equality constraint on the number of bottles that must be chosen. The third problem seeks to maximize the sum of ranks from three different cultivars (cabernet sauvignon, pinot noir, and zinfandel) subject to a budget constraint and then a budget and minimum bottle constraints for each cultivar. The sum of rank maximization problems may have multiple solutions. We also pose two expenditure minimization problems, subject to achieving the maximum sum of ranks. We also explore how a KP might be formulated when wine is viewed as an investment.
|Date of creation:||2010|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://aem.cornell.edu/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Clarke, Harry R. & Reed, William J., 1989.
"The tree-cutting problem in a stochastic environment : The case of age-dependent growth,"
Journal of Economic Dynamics and Control,
Elsevier, vol. 13(4), pages 569-595, October.
- Harry R Clarke & William J. Reed, 1989. "The Tree-Cutting Problem in a Stochastic Environment: The case of Age Dependent Growth," Working Papers 1989.01, School of Economics, La Trobe University.
When requesting a correction, please mention this item's handle: RePEc:ags:cudawp:126966. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (AgEcon Search)
If references are entirely missing, you can add them using this form.