Escolar Documentos
Profissional Documentos
Cultura Documentos
1)
Indicate graphically whether each of the following linear programs has a feasible solution. Graphically
determine the optimal solution, if one exists, or show that none exists.
a) Maximize 𝑧 = 𝑥1 + 2𝑥2
subject to:
𝑥1 − 2𝑥2 ≤ 3,
𝑥1 + 𝑥2 ≤ 3,
𝑥1 ≥ 0, 𝑥2 ≥ 0
b) Minimize 𝑧 = 𝑥1 + 𝑥2 ,
subject to:
𝑥1 − 𝑥2 ≤ 2
𝑥1 − 𝑥2 ≤ −2,
𝑥1 ≥ 0, 𝑥2 ≥ 0
c) Redo (b) with the objective function -> Maximize 𝑧 = 𝑥1 + 𝑥2
subject to:
𝑥1 − 2𝑥2 ≥ 4
𝑥1 + 𝑥2 ≤ 3
𝑥1 ≥ 0, 𝑥2 ≥ 0
2)
Feed to three units is split into three streams: FA, FB, and Fc. Two products are produced P1 and P2
(see following figure), and the yield in weight percept by unit is:
Stream F 𝑃1 𝑃2
Value .40 .60 .30
In order to determine the values of FA, FB, and Fc that maximize the daily
profit, prepare a mathematical statement of this problem as a linear programming
problem. Do not solve it.
3)
An oil refinery has to blend gasoline. Suppose that the refinery wishes to blend four
petroleum constituents into three grades of gasoline: A, B, and C. Determine the mix
of the four constituents that will maximize profit.
The availability and costs of the four constituents are given in the following table:
To maintain the required quality for each grade of gasoline, it is necessary to specify
certain maximum or minimum percentages of the constituents in each blend. These are
shown in the following table, along with the selling price for each grade.
Assume that all other cash flows are fixed so that the "profit" to be maximized is total
sales income minus the total cost of the constituents. Set up a linear programming
model for determining the amount and blend of each grade of gasoline.