Scribd
Upload
16 views

Answer

The document provides a problem set with 5 problems involving linear programming. Problem 1 asks to graph constraints, problem 2 involves graphing objective functions, problem 3 uses graphical method to solve a LP problem. Problem 4 formulates and solves a LP model for a business. Problem 5 formulates and solves a LP model for a food processing plant to maximize profit.

Uploaded by

eleazarmontes09
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Answer

The document provides a problem set with 5 problems involving linear programming. Problem 1 asks to graph constraints, problem 2 involves graphing objective functions, problem 3 uses graphical method to solve a LP problem. Problem 4 formulates and solves a LP model for a business. Problem 5 formulates and solves a LP model for a food processing plant to maximize profit.

Uploaded by

eleazarmontes09
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

IE 217 Operations Research 1

Problem Set 1

Problems.
1. For each of the following constraints, draw a separate graph to show the nonnegative
solutions that satisfy these constraints.
a. 𝑥1 + 3𝑥2 ≤ 6
b. 4𝑥1 + 3𝑥2 ≤ 12
c. 4𝑥1 + 𝑥2 ≤ 8
d. Now combine these constraints into a single graph to show the feasible region for the
entire set of functional constraints plus nonnegativity constraints.
2. Consider the following objective function for a linear programming model:
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 2𝑥1 + 3𝑥1
a. Draw a graph that shows the corresponding objective function lines for Z = 6, Z = 12,
and Z = 18.
b. Find the slope intercept form of the equation for each of these three objective
function lines. Compare the slope for these three lines. Also compare the intercept
with the x2 axis.
3. Use the graphical method to solve the problem:
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 10𝑥1 + 20𝑥1.
Subject to:
− 𝑥1 + 2𝑥2 ≤ 15
𝑥1 + 𝑥2 ≤ 12
5𝑥1 + 3𝑥2 ≤ 6
And
𝑥1≥0, 𝑥2≥0

minimum value

The minimum value is 161.5 at (9.23, 3.46).

The minimum value is 161.5 at (9.23, 3.46).


4. The Primo Insurance Company is introducing two new product lines: special risk insurance
and mortgages. The expected profit is $5 per unit on special risk insurance and $2 per unit
on mortgages.
Management wishes to establish sales quotas for the new product lines to maximize
total expected profit. The work requirements are as follows:

a. Formulate a linear programming model for this problem.


b. Use the graphical method to solve this model.
c. Verify the exact value of your optimal solution from part - by solving algebraically for
the simultaneous solution of the relevant two equations.
- The minimum profit is (z) = 3600 at (300, 600).
5. Weenies and Buns is a food processing plant which manufactures hot dogs and hot dog buns.
They grind their own flour for the hot dog buns at a maximum rate of 200 pounds per week.
Each hot dog bun requires 0.1 pound of flour. They currently have a contract with Pigland,
Inc., which specifies that a delivery of 800 pounds of pork product is delivered every
Monday. Each hot dog requires pound of pork product. All the other ingredients in the hot
dogs and hot dog buns are in plentiful supply. Finally, the labor force at Weenies and Buns
consists of 5 employees working full time (40 hours per week each). Each hot dog requires 3
minutes of labor, and each hot dog bun requires 2 minutes of labor. Each hot dog yields a
profit of $0.88, and each bun yields a profit of $0.33.
Weenies and Buns would like to know how many hot dogs and how many hot dog
buns they should produce each week to achieve the highest possible profit.
a. Formulate a linear programming model for this problem.
b. Use the graphical method to solve this model.

SOLUTION:
(a) Let x be the number of hot dogs produced each week and y be the number of hot dog buns
produced each week. The objective function is the profit, which is 0.20x + 0.10y. The constraints are:
- Flour constraint: 0.1y <= 200
- Pork product constraint: 0.25x <= 800
- Labor constraint: 3x + 2y <= 5 * 40 * 60 (5 employees working 40 hours per week, with 60
minutes per hour)
- Non-negativity constraint: x >= 0, y >= 0

The linear programming model is:


-Maximize 0.20x + 0.10y subject to:
0.1y <= 200
0.25x <= 800
3x + 2y <= 5 * 40 * 60
x >= 0
y >= 0

(b) To solve the model graphically, we need to plot the constraints and find the feasible region. The
feasible region is the set of points that satisfy all the constraints. We can find the intersection points
of the constraints by solving the equations:
0.1y = 200 => y = 2000
0.25x = 800 => x = 3200
3x + 2y = 5 * 40 * 60 => y = 1500 - 1.5x
The feasible region is a quadrilateral bounded by the x-axis, the y-axis, the line y = 2000, and the line
y = 1500 - 1.5x. The corner points of the feasible region are (0,0), (0,2000), (1200,1500), and
(3200,0). We can substitute these points into the objective function to find the maximum profit:
0.20(0) + 0.10(0) = 0
0.20(0) + 0.10(2000) = 200
0.20(1200) + 0.10(1500) = 330
0.20(3200) + 0.10(0) = 640
The maximum profit is 640, which occurs at the point (3200,0). Therefore, the optimal solution is to
produce 3200 hot dogs and 0 hot dog buns each week.
(c) The shadow price for a constraint is the amount by which the objective function value will change
if the right-hand side of the constraint is increased by one unit. The shadow price for the flour
constraint is 0, which means that increasing the amount of flour available will not change the optimal
solution or the maximum profit. The shadow price for the pork product constraint is 0.8, which
means that increasing the amount of pork product available by one pound will increase the
maximum profit by $0.80. The shadow price for the labor constraint is 0, which means that
increasing the amount of labor available will not change the optimal solution or the maximum profit.

You might also like