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: 12 x1+21 x2+7 x3+15 x4
Subject to:
4 x1+3 x2+2 x3+5 x4...400
2 x1+1.5 x2+3.3 x3+2 x4...150
x145
x2...100
x1, x2, x3, x40(nonnegative)
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 1 and 10,
where
1I dont mind this food at all; serve it up!
4I can eat some of it, but tire of it quickly.
8I would prefer not to eat this food.
10Ill 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 # 12345678910
Name Rice Cabbage Spinach Peanuts Or. Juice Tuna Turkey Pork Bread
Lima
Beans
Nutrient
Thiamin mg 0000.40.2000.800.4
Riboflavin mg 000.1000.1000.80
Niacin mg 4002001010600
Folic Acid mg 112312320109000078
Vitamin C mg 01242806400009
Distaste Factor 1431121317
Cost $ 0.250.170.350.950.751.450.851.850.150.35
414 Chapter 9 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 blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!