3-2. In the diet model (Example 2.

2-2), determine the surplus amount of feed consisting of 525 lb

of corn and 425 lb of soybean meal.

3-3. Consider the following inequality

22𝑥𝑥1 − 4𝑥𝑥2 ≥ −7

Show that multiplying both sides of the inequality by -1 and then converting the resulting
inequality into an equation is the same as converting it first to an equation and then
multiplying both sides by -1.

3-5. Show how the following objective function can be presented in equation form:

Minimize 𝑧𝑧 = max{|𝑥𝑥1 − 𝑥𝑥2 + 3𝑥𝑥3 |, | − 𝑥𝑥1 + 3𝑥𝑥2 − 𝑥𝑥3 |}

𝑥𝑥1 , 𝑥𝑥2 , 𝑥𝑥3 ≥ 0

(Hint:|𝑎𝑎| ≤ 𝑏𝑏 is equivalent to 𝑎𝑎 ≤ 𝑏𝑏 and 𝑎𝑎 ≥ −𝑏𝑏)

3-11. Consider the following LP:

𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑧𝑧 = 2𝑥𝑥1 + 3𝑥𝑥2

Subject to

𝑥𝑥1 + 3𝑥𝑥2 ≤ 12

3𝑥𝑥1 + 2𝑥𝑥2 ≤ 12

𝑥𝑥1 , 𝑥𝑥2 ≥ 0

*(a) Express the problem in equation form.

(b) Determine all the basic solutions of the problem, and classify them as feasible and infeasible

*(c) Use direct substitution in the objective function to determine the optimum basic feasible
solution

(d) Verify graphically that the solution obtained in (c) is the optimum LP solution-hence, conclude
that the optimum solution can be determined algebraically by considering the basic feasible
solutions only.

*(e) Show how the infeasible basic solutions are represented on the graphical solution space.
3-22. Consider the following set of constraints:

𝑥𝑥1 + 2𝑥𝑥2 + 2𝑥𝑥3 + 4𝑥𝑥4 ≤ 40

2𝑥𝑥1 − 𝑥𝑥2 + 𝑥𝑥3 + 2𝑥𝑥4 ≤ 8

4𝑥𝑥1 − 2𝑥𝑥2 + 𝑥𝑥3 − 𝑥𝑥4 ≤ 10

𝑥𝑥1 , 𝑥𝑥2 , 𝑥𝑥3 , 𝑥𝑥4 ≥ 0

Solve the problem for each of the following objective functions.

(a) 𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑒𝑒 𝑧𝑧 = 2𝑥𝑥1 + 𝑥𝑥2 -3𝑥𝑥3 + 5𝑥𝑥4

3-24. Consider the following LP:

𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑧𝑧 = 𝑥𝑥1

Subject to

5𝑥𝑥1 + 𝑥𝑥2 = 4

6𝑥𝑥1 + 𝑥𝑥3 =8

3𝑥𝑥1 + 𝑥𝑥4 = 3

𝑥𝑥1 , 𝑥𝑥2 , 𝑥𝑥3 , 𝑥𝑥4 ≥ 0

(a) Solve the problem by inspection (do not use the Gauss-Jordan row operations), and justify
the answer in terms of the basic solutions of the simplex method.

(b) Repeat (a) assuming that the objective function calls for 𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚𝑚 𝑧𝑧 = 𝑥𝑥1

3-42. Show that the M-method will conclude that the following problem has no feasible solution.

𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑧𝑧 = 2𝑥𝑥1 + 5𝑥𝑥2

Subject to

3𝑥𝑥1 + 2𝑥𝑥2 ≥ 6

2𝑥𝑥1 + 𝑥𝑥2 ≤ 2

𝑥𝑥1 , 𝑥𝑥2 ≥ 0
3-56. Solve the following LP:

𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑧𝑧 = 2𝑥𝑥1 − 𝑥𝑥2 + 3𝑥𝑥3

Subject to

𝑥𝑥1 − 𝑥𝑥2 + 5𝑥𝑥3 ≤ 5

2𝑥𝑥1 − 𝑥𝑥2 + 3𝑥𝑥3 ≤ 20

𝑥𝑥1 , 𝑥𝑥2 , 𝑥𝑥3 ≥ 0

From the optimal tableau, show that all the alternative optima are not corner
points(i.e.,nonbasic).

3-63. A company produces two products, A and B. The unit revenues are $2 and $3, respectively.
Two raw materials, M1 and M2, used in the manufacture of the two products have daily
availabilities of 8 and 18 units, respectively. One unit of A uses 2 units of M1 and 2 units of
M2, and 1 unit of B uses 3 units of M1 and 6 units of M2.

(a) Determine the dual prices of M1 and M2 and their feasibility ranges.

(b) Suppose that 2 additional units of M1 can be acquired at the cost of 25 cents per unit.
Would you recommend the additional purchase?

(c) What is the most the company should pay per unit of M2?

(d) If M2 availability is increased by 3 units, determine the associated optimum revenue.

3-65. Consider Problem 3-63.

𝐶𝐶𝐴𝐴
(a) Determine the optimality condition for that will keep the optimum unchanged.
𝐶𝐶𝐵𝐵

(b) Determine the optimality ranges for 𝐶𝐶𝐴𝐴 and 𝐶𝐶𝐵𝐵 , assuming that the other coefficient is
kept constant at its present value.

(c) If the unit revenues 𝐶𝐶𝐴𝐴 and 𝐶𝐶𝐵𝐵 are changed simultaneously to $5 and $4, respectively,
determine the new optimum solution.

(d) If the changes in (c) are made one at a time, what can be said about the optimum
solution?