UEMT 3113 Operations research and

optimization
Solution for tutorial 2

1. Solution

The revenue per hour is the sum of the revenues from selling the steam and the
electricity.
1.65 1.10
Revenue = 1000 (3600 𝑥1 ) + (3600𝑥2 ) + 0.03(48𝑤𝐴 + 56𝑤𝐵 + 80𝑤𝑐 )
1000

Since wA = 3.2 kg/s and from mass balances wB = 3.2 – x1 and wc = 3.2 –x1 –x2

Revenue = 17.66 + 1.86x1 + 1.56x2

Because the constant has no effect on the state point at which the optimum
occurs, the objective function to be maximized is

𝑦 = 1.86𝑥1 + 1.56𝑥2
The three constraints are

𝑥1 + 𝑥2 ≤ 2.6
𝑥1 + 4𝑥2 ≤ 7.2
4𝑥1 + 3𝑥2 ≤ 9.6
x1, x2  0

Or

x1 + x2 + s1 = 2.6

x1 + 4x2 + s2 = 7.2

4x1 + 3x2 + s3 = 9.6

x1, x2, s1, s2, s3  0

From the final tableau, the maximum revenue is z = $ 4.596 and this occurs when x1 =
1.8, and x2 = 0.8.

1
2
2. Solution

Let x1, x2, and x3 represent the numbers of advertisements in television, newspaper,
and radio, respectively.

LP model

z = 100,000x1 + 40,000x2 + 18,000x3

subject to

2000x1 + 600x2 + 300x3  18,200

x2  10

x3  0.5(x1 + x2 + x3)

 0.1(x1 + x2 + x3)

x1, x2, x3  0

Or

20x1 + 6x2 + 3x3 + s1 = 182

x2 + s2 = 10

-x1 - x2 + x3 + s3 = 0

-9x1 + x2 + x3 + s4 = 0

x1, x2, x3, s1, s2, s3, s4  0

3
From the final tableau, the maximum weekly audience for an advertising budget of
$ 18,200 is

z = $ 1,052,000

and this occurs when x1 = 4, x2 = 10, and x3 = 14. The results are summarized as follows.

Media Number of advertisement Cost Audience

Television 4 $8000 400,000
Newspaper 10 $6000 400,000
Radio 14 $4200 252,000
Total 28 $18,200 1,052,000

4
3. Solution

Let x1, x2, and x3 represent model A, model B and Model C of the bicycles,
respectively.

LP model

z = 45x1 + 50x2 + 55x3

subject to

2x1 + 2.5x2 + 3x3  4006 (assembling)

1.5x1 + 2x2 + x3  2495 (painting)

x1 + 0.75x2 + 1.25x3  1500 (packaging)

x1, x2, x3  0

Or
2x1 + 2.5x2 + 3x3 + s1 = 4006 (assembling)

1.5x1 + 2x2 + x3 + s2 = 2495 (painting)

x1 + 0.75x2 + 1.25x3 + s3 = 1500 (packaging)

x1, x2, x3, s1, s2, s3  0

From the final tableau, the maximum profit for the manufacturer is

z = $ 79,310

and this occurs when x1 = 322, x2 = 764, and x3 = 484. The results are summarized as
follows.

Media Number of hour slack

Assembly 4006 0
Painting 2495 0
Packaging 1500 0

5
6
4. Solution

Minimize Z = 5x1 – 4x2 + 6x3 – 8x4

Subject to
x1 + 2x2 + 2x3 + 4x4 + s1 = 40
2x1 - x2 + x3 + 2x4 + s2 = 8
4x1 – 2x2 + x3 – x4 + s3 = 10
x1, x2, x3, x4, s1, s2, s3  0

x2 = 6 and x4 = 7 with Z = -80.

7
5. Solution

Ley x1 and x2 represent the numbers of cars shipped from factory 1 to the first and
second customers, respectively. The total cost of shipping is

C = 30x1 + 25x2 + 36(200 - x1) + 30(300 - x2)

= 16,200 – 6x1 - 5x2

The constraints for the minimization problem are as follows.

x1 + x2  400
(200 - x1) + (300 - x2)  400  x1 + x2  200
x1  200
x2  300
x1, x2  0
The corresponding maximization problem is to maximize z = 6x1 + 5x2 – 16,200.

x1 + x2 + s1 = 400
x1 + x2 –e2 = 200
x1 + s3 = 200
x2 + s4 = 300
x1, x2, s1, e2, s3, s4  0

From the tableau, the minimum shipping cost is $ 14,000. Because x1 = 200 and x2 =
200, you can conclude that the numbers of cars that should be shipped from the two
factories are as shown below.

Customer 1 Customer 2
Factory 1 200 cars 200 cars
Factory 2 0 100 cars

8
9