Juan Hernandez, a Cuban athlete who visits the Unite States and Europe
frequently, is allowed to retrun with a limited number of consumer items
not generally available in Cuba. The items, which are carried in a
duffle bag, cannot exceed a weight of 5 pounds. Once Juan is in Cuba,
he sells the items at highly inflated prices. The three most popular
items in Cuba are denim jeans, CD players, and CDs of U.S. rock groups.
The weight and profit (in U.S. dollars) of each items are as follows.
Items Weight (lb) Profit ($)
1. Denim jeans 2 90
2. CD players 3 150
3. Compact discs 2 30
Juan wants to determine the combination of items he should pack in his
duffel bag that will maximize his profit. The problem is an example of
a type of integer programming known as a “knapsack” problem.
Formulate and solve this problem.
Mathematics Homework Solutions
#93302
Integer Programming : Knapsack Problems
Juan Hernandez, a Cuban athlete who visits the Unite States and Europe frequently, is allowed to return with a limited number of consumer items not generally available in Cuba. The items, which are carried in a duffle bag, cannot exceed a weight of 5 pounds. Once Juan is in Cuba, he sells the items at highly inflated prices. The three most popular items in Cuba are denim jeans, CD players, and CDs of U.S. rock groups. The weight and profit (in U.S. dollars) of each items are as follows.
Items Weight (lb) Profit ($)
1. Denim jeans 2 90
2. CD players 3 150
3. Compact discs 2 30
Juan wants to determine the combination of items he should pack in his duffel bag that will maximize his profit. The problem is an example of a type of integer programming known as a "knapsack" problem. Formulate and solve this problem.
keywords: napsack, nap sack
A knapsack problem is solved. The solution is detailed and well presented.
What is this?
By OTA - Overall OTA Rating
Departed OTA
Purchase Cost Now
$2.19 CAD (was ~$19.95)
Included in Download
- Plain text response
- Attached file(s):
- ans.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Knapsack Problem : Write in Canonical Form - Let [EQUATION1] with [EQUATION2] and [EQUATION3]. The idea is to write each such set in some simple canonical form. (i) When n = 2, how many distinct knapsack sets are there? Write them out in a ca ...
- Linear Programming : Maximizing Subject to Constraints and Knapsack Algorithm Problem - 1. Solve the following linear programming problem by the simplex method. At each iteration, identify B and B-1 Maximize 3x1 + 2x2 + x3 Subject to 3x1 - 3x2 + 2x ...
- The problems are from Boundary Value Problems - The problems are from Boundary Value Problems. Undergrad 400 level course. Mainly uses partial differential skills. Some problems might require using MATLAB. Please explain each step of your solution ...
- Help with HW 8 - Please see attached for the full details of the problems. There are 35 problems all in all.
- Algebra Problems - Please solve problems provide answers and show all work.
