[See Solution] A camper is considering taking two types of items on a camping trip. Item 1 weighs a 1 lb, and item 2 weighs a 2 lb. Each type 1 item ears the
Question: A camper is considering taking two types of items on a camping trip. Item 1 weighs a 1 lb, and item 2 weighs a 2 lb. Each type 1 item ears the camper a benefit of c 1 units, and each type 2 item earns the camper a benefit of c 2 units. The knapsack can hold items weighing at most b lb.
- Assuming that the camper can carry a fractional number of items along on the trip, formulate an LP to maximize benefit.
- Show that if c 2 / a 2 \(\ge \) c 1 /a 1 , then the camper can maximize benefit by filling a knapsack with b/a 2 type 2 items.
- Which of the linear programming assumptions are violated by this formulation of the camper's problem?
Price: $2.99
Solution: The downloadable solution consists of 1 pages
Deliverable: Word Document 