dietiNTEGER - Diet problem The integer programming version...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Diet problem The integer programming version Remember the diet problem we studied earlier. We are going to study a variation of this problem. Janet is a college student who lives on a very tight budget for the new semester .and decides to eat at an inexpensive burger joint near her dorm. The restaurant serves hamburger, cheeseburger, chicken sandwich, salad and chicken soup. Janet has certain weekly nutritional requirement and the minimum and the maximum (if any) of these requirement along with nutritional content of each food item and their price is given in a table in the following worksheet (diet LP). In order to avoid having the same food every day, Janet limits the number of times a given food is purchased to at most three in a week. As before if we solve the diet problem to find out the least expensive weekly diet, we see that some of the food item should be purchased in fractional quantities. Of course the restaurant does not allow this. So in the following worksheet (diet IP) we add the
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/17/2010 for the course MSIS 623:386 taught by Professor Markowitz during the Fall '09 term at Rutgers.

Page1 / 6

dietiNTEGER - Diet problem The integer programming version...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online