Scribd
Upload
171 views5 pages

Ex 6.1. Linear Programming (Diet Problem)

The document provides information about the daily vitamin requirements of vitamins C, D, and E. It also provides the vitamin contents and costs of two food mixes, X and Y. The goal is to determine the number of portions of each food mix needed to meet the daily requirements at minimum cost. This is formulated as a linear programming problem with decision variables x and y representing the number of portions of X and Y, respectively. The objective is to minimize total cost which is defined as 5x + 4y. The constraints ensure the daily requirements of vitamins C, D, and E are met. The optimal solution is x = 6 portions of X and y = 16 portions of Y, with a total minimum cost of 94.

Uploaded by

aaronkim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
171 views5 pages

Ex 6.1. Linear Programming (Diet Problem)

The document provides information about the daily vitamin requirements of vitamins C, D, and E. It also provides the vitamin contents and costs of two food mixes, X and Y. The goal is to determine the number of portions of each food mix needed to meet the daily requirements at minimum cost. This is formulated as a linear programming problem with decision variables x and y representing the number of portions of X and Y, respectively. The objective is to minimize total cost which is defined as 5x + 4y. The constraints ensure the daily requirements of vitamins C, D, and E are met. The optimal solution is x = 6 portions of X and y = 16 portions of Y, with a total minimum cost of 94.

Uploaded by

aaronkim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Worked Example 9.

1
A daily diet requires a minimum of 600 mg of vitamin C, 360 mg of vitamin D, 40 mg of vitamin E.
The contents of these vitamins (per portion) in two food mixes, X and Y
Determine the number of portions of mixes X and Y which full the daily requirements at minimum c

Vit C (mg) Vit D (mg) Vit E (mg) Cost/ portion


One portion of X 20 10 4 5
One portion of Y 30 20 1 4
Minimum requirement 600 360 40

LP Formulation:

Decision Variables

x = optimum number of portion food mixes X


y = optimum number of portion food mixes Y
Objective Function

Minimize Cost: Z = 5x + 4y
Subject to Constraints

20x+30y >= 600 (minimum vitamin C)

10x+20y >=360 (minimum vitamin D)


4x+y >=40 (minimum vitamin E)
x,y >=0 (non negativity)
of vitamin E.

daily requirements at minimum cost!

Running Solver: Tab Data > Solve


LINEAR PROGRAMMING SOLUTION:

decision var. x y
Solution: 6 16
objective: Minimize Z = 94

constraints Left-side sign Right-side


vitamin C 600 >= 600
vitamin D 380 >= 360
vitamin E 40 >= 40

Answer:
Optimal Solution:
Food mixes X = 6
Food mixes Y = 16
Cost = 94
Objective Function
Solver: Tab Data > Solver

Objective Function

Decision Variables

Click on "Add" to insert


constraints

Check to make variables


nonnegative

After all parameters and


constraints have been
input click on "Solve"
Select Left-Side Column Choose sign Select Right-Side Column

Click "OK" to finish add/ Click "Add" to adding more


change Constraints constraints with different sign

You might also like