4-4.

Write the dual for each of the following primal problems:

(a) Maximize 𝑧𝑧 = 66𝑥𝑥1 − 22𝑥𝑥2

Subject to

−𝑥𝑥1 + 𝑥𝑥2 ≤ −2

2𝑥𝑥1 + 3𝑥𝑥2 ≤ 5

𝑥𝑥1 , 𝑥𝑥2 ≥ 0

(b) Maximize 𝑧𝑧 = 6𝑥𝑥1 + 3𝑥𝑥2

Subject to

6𝑥𝑥1 − 3𝑥𝑥2 + 𝑥𝑥3 ≥ 25

3𝑥𝑥1 + 4𝑥𝑥2 + 𝑥𝑥3 ≥ 55

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

(c) Maximize 𝑧𝑧 = 𝑥𝑥1 + 𝑥𝑥2

Subject to

2𝑥𝑥1 + 𝑥𝑥2 = 5

3𝑥𝑥1 − 𝑥𝑥2 = 6

𝑥𝑥1 , 𝑥𝑥2 unrestricted

4-10. Find the optimal value of the objective function for the following problem by inspecting
only its dual. (Do not solve the dual by the simplex method)

𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑧𝑧 = 10𝑥𝑥1 + 4𝑥𝑥2 + 5𝑥𝑥3

subject to

5𝑥𝑥1 − 7𝑥𝑥2 + 3𝑥𝑥3 ≥ 20

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

4-14. Consider the following LP:

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

subject to

𝑥𝑥1 + 𝑥𝑥2 + 𝑥𝑥3 =4

𝑥𝑥1 + 4𝑥𝑥2 + 𝑥𝑥4 = 8

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

Using 𝑥𝑥3 and 𝑥𝑥4 as starting variables, the optimal tableau is given as

Basic 𝑥𝑥1 𝑥𝑥2 𝑥𝑥3 𝑥𝑥4 Solution

𝑧𝑧 2 0 0 3 16

𝑥𝑥3 .75 0 1 -.25 2

𝑥𝑥4 .25 1 0 .25 2

Write the associated dual problem, and determine its optimal solution in two ways. (matrix
form and complementary slackness condition)

4-20. Consider the following LP model:

𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀𝑀 𝑧𝑧 = 4𝑥𝑥1 + 14𝑥𝑥2

subject to

2𝑥𝑥1 + 7𝑥𝑥2 + 𝑥𝑥3 = 21

7𝑥𝑥1 + 2𝑥𝑥2 + 𝑥𝑥4 = 21

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

1
0
7
*(a) Basic variables = (𝑥𝑥2 , 𝑥𝑥4 ), Inverse = � 2 �
− 1
7

1
0
2
(b) Basic variables = (𝑥𝑥2 , 𝑥𝑥3 ), Inverse = � 7�
1 −
2

7 2
−
45 45
(c) Basic variables = (𝑥𝑥2 , 𝑥𝑥1 ), Inverse = � 2 7 �
−
45 45

1
0
2
(d) Basic variables = (𝑥𝑥1 , 𝑥𝑥4 ), Inverse = � 7 �
− 1
2

5-8. Three refineries with daily capacities of 6, 5, and 8 million gallons, respectively, supply
three distribution areas with daily demands of 4, 8, and 7 million gallons, respectively.
Gasoline is transported to the three distribution areas through a network of pipelines.
The transportation cost is 10 cents per 1000 gallons per pipeline mile. Table 5.26 gives the
 mileage between the refineries and the distribution areas. Refinery 1 is not connected to
distribution area 3.

(a) Construct the associated transportation model.

(b) Determine the optimum shipping schedule in the network.

5-14. In Example 5.2-1, suppose that the holding cost per unit is period-dependent and is given
by 20, 15, and 35 cents for periods 1, 2, and 3, respectively. The penalty cost is $1 per
period and the production costs remain as given in the example. Determine the optimum
solution and interpret the results.

5-22-(b). Compare the starting solutions obtained by the northwest-corner, least-cost, and Vogel
methods for each of the models in Table 5.33. (solve (b))

5-24. In the transportation problem in Table 5.35, the total demand exceeds the total supply.
Suppose that the penalty costs per unit of unsatisfied demand are $2, $5, and $3 for
destinations 1, 2, and 3, respectively. Use the least-cost starting solution and compute the
iterations leading to the optimum solution.

5-33. JoShop needs to assign four jobs to four workers. The cost of performing a job is a
function of the skills of the workers. Table 5.40 summarizes the cost of the assignments.
Worker 1 cannot do job 3, and worker 3 cannot do job 4. Determine the optimal assignment
using the Hungarian method.
5-34. In the JoShop model of Problem 5-33, suppose that an additional (fifth) worker becomes
available for performing the four jobs at the respective costs of $60, $45, $30, and $80.
Is it economical to replace one of the current four workers with the new one?