0% found this document useful (0 votes)
28 views8 pages

(OR1) HW1+Solution

abcsdafa

Uploaded by

mytiensakura
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
28 views8 pages

(OR1) HW1+Solution

abcsdafa

Uploaded by

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

Student Name: …

Student ID: …

DETERMINISTIC MODELS IN OR
HOMEWORK 1 – Formulating LPP &
Solving LPP using Graphical Method

Question 1 (3.2-1)

The following table summarizes the key facts about two products, A and B, and the resources, Q,
R, and S, required to produce them.
Table 1. Data for Question 3

Resource Usage per Unit


Amount of Resource
Machine Type Product
Available
Product A Product B
Q 2 1 2
R 1 2 2
S 3 3 4
Profit per unit 3 2

All the assumptions of linear programming hold.

a. Formulate a linear programming model for this problem.

Let x 1 be the number of product A produced, x 2 be the number of product B produced


Maximize P=3 x 1 +2 x 2
Subject to
2 x1 + x 2 ≤2
x 1+ 2 x 2 ≤2
3 x 1+3 x 2 ≤ 4
x1 ≥ 0 , x2 ≥ 0

b. Solve this model graphically


Student Name: …
Student ID: …

¿ ¿ 2 2
The optimal solution: ( x 1 , x 2 )=( , ) and P¿ =3.33
3 3

Question 2 (3.4-5)
Use the graphical method to solve the problem:
Minimize Z=15 x1 +20 x 2
Subject to
x 1+ 2 x 2 ≥10
2 x1 −3 x 2 ≤6
x 1+ x2 ≥ 6
x1 ≥ 0 , x2 ≥ 0
Student Name: …
Student ID: …
¿ ¿
The optimal solution: ( x 1 , x 2 )=(2 , 4) and Z ¿=110

Question 3 (3.4-9)

Ralph Edmund loves steaks and potatoes. Therefore, he has decided to go on a steady diet of
only these two foods (plus some liquids and vitamin supplements) for all his meals. Ralph
realizes that this isn’t the healthiest diet, so he wants to make sure that he eats the right quantities
of the two foods to satisfy some key nutritional requirements. He has obtained the nutritional and
cost information shown at the top of the next column.

Ralph wishes to determine the number of daily servings (maybe fractional) of steak and potatoes
that will meet these requirements at a minimum cost.
Grams of Ingredient
Daily Requirement
Ingredient per Serving
(Grams)
Steak Potatoes
Carbohydrates 5 15 ≥ 50
Protein 20 5 ≥ 40
Fat 15 2 ≤ 60
Cost per Serving $4 $2

a. Formulate a linear programming model for this problem.

Let x 1 be the number of daily servings of steak, x 2 be the number of daily servings of potatoes
Maximize C=4 x1 +2 x 2
Subject to
5 x 1+15 x 2 ≥ 50
20 x 1+5 x 2 ≥ 40
15 x 1+2 x 2 ≤ 60
x1 ≥ 0 , x2 ≥ 0

b. Solve this model graphically


Student Name: …
Student ID: …

¿ ¿
The optimal solution: ( x 1 , x 2 )=(1.3 , 2.9) and C ¿=10.91
Additional exercise for practice:

Question 4 (3.1-6)
Use the graphical method to solve the problem:
Maximize Z=10 x1 +20 x 2
Subject to
−x 1+ 2 x 2 ≤15
x 1+ x2 ≤12
5 x 1+3 x 2 ≤ 45
x1 ≥ 0 , x2 ≥ 0
Student Name: …
Student ID: …
Question 5 (3.1-11)
The Omega Manufacturing Company has discontinued the production of a certain unprofitable
product line. This act created considerable excess production capacity. Management is
considering devoting this excess capacity to one or more of three products; call them products 1,
2, and 3. The available capacity on the machines that might limit output is summarized in the
following table:
Table 2. The available capacity on each machine type

Available Time
Machine Type
(Machine Hours per Week)
Milling machine 500
Lathe 350
Grinder 150

The number of machine hours required for each unit of the respective products is
Table 3. Productivity coefficient (in machine hours per unit)

Machine Type Product 1 Product 2 Product 3


Milling machine 9 3 5
Lathe 5 4 0
Grinder 3 0 2

The sales department indicates that the sales potential for products 1 and 2 exceeds the maximum
production rate and that the sales potential for product 3 is 20 units per week. The unit profit
would be $50, $20, and $25, respectively, on products 1, 2, and 3. The objective is to determine
how much of each product Omega should produce to maximize profit.

Formulate a linear programming model for this problem.


Student Name: …
Student ID: …
Question 6
Consider a linear programming model:

Minimize Z=40 x 1 +50 x 2


Subject to
2 X 1 +3 X 2 ≥30 (resource 1)

X 1 + X 2 ≥ 12 (resource 2)

2 X 1 + X 2 ≥ 20 (resource 3)

X 1 , X 2 ≥0

a. Solve this problem by using graphical method


Student Name: …
Student ID: …

b. How does the optimal solution change if the objective function is changed to
Z=40 X 1+70 X 2?
Z = 600
c. Use graphical analysis to find the shadow prices for three resources.
Shadow price of resource 1: 15
Shadow price of resource 2: 10
Shadow price of resource 3: 5
d. Determine how many additional units of resource 1 would be needed to increase the
optimal value of Z by 45.
Increase 3 units

Question 7 (3.4-17)
Joyce and Marvin run a day care for preschoolers. They are trying to decide what to feed the
children for lunch. They would like to keep their costs down, but also need to meet the
nutritional requirements of the children. They have already decided to go with peanut butter and
jelly sandwiches, and some combination of graham crackers, milk, and orange juice. The
nutritional content of each food choice and its cost are given in the table below.

The nutritional requirements are as follows. Each child should receive between 400 and 600
calories. No more than 30 percent of the total calories should come from fat. Each child should
Student Name: …
Student ID: …
consume at least 60 milligrams (mg) of vitamin C and 12 grams (g) of protein. Furthermore, for
practical reasons, each child needs exactly 2 slices of bread (to make the sandwich), at least
twice as much peanut butter as jelly, and at least 1 cup of liquid (milk and/or juice).

Joyce and Marvin would like to select the food choices for each child which minimize cost while
meeting the above requirements.

Formulate a linear programming model for this problem.

You might also like