Question: Solve the following linear programming problem: Maximize: 1 2 x 1 + 2 1 x 2 + 7 x 3 + 1 5 x 4
Solve the following linear programming problem:
Maximize: x x x x
Subject to:
x x x x
x x x x
x
x
x x x xnonnegative
Rework the linear programming application example presented in this chapter
with a new objective function. This time, the objective will be to minimize a distaste
factor rather than cost. The distaste factor can have a value between and
where
I dont mind this food at all; serve it up
I can eat some of it but tire of it quickly.
I would prefer not to eat this food.
Ill gag if I have to eat this food.
The distaste factors are obviously specific to each individual, but a set of distaste fac
tors has been assigned to each food in the following table:
Food #
Name Rice Cabbage Spinach Peanuts Or Juice Tuna Turkey Pork Bread
Lima
Beans
Nutrient
Thiamin mg
Riboflavin mg
Niacin mg
Folic Acid mg
Vitamin C mg
Distaste Factor
Cost $
Chapter Iterative Solutions Using Excel
a Solve the linear programming problem to minimize distaste factor while
still satisfying each of the nutritional constraints listed in the application
example. How many servings of each type of food are needed, and what
is the overall distaste level?
b Create your own set of distaste factors for these foods and repeat step a
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
