TUTORIAL 3 – LINEAR PROGRAMMING

Question 1

Solve the following linear programming problem graphically, using the corner point method.

Maximize Z = 5x + 6y
Subject to:
x + 4y ≥ 10
x + 3y ≤ 12
x≤y
x,y≥0
(x = 3, y = 3, Profit, Z = RM33)

Question 2

A housing developer has purchased 20,000 m2 of land on which he is planning to build two types
of houses, detached and semi-detached within an overall budget of RM3 millions. A detach
house costs RM60.000 to build and requires 650 m2 of land and a semi-detach house costs
RM40.000 to build and requires 300 m2 of land. From past experience, the developer estimates
the profits of a detach house and a semi detach house to be about RM9.000 and RM6.000
respectively.
a) Formulate a linear programming (LP) model for this problem.
b) Write down the dual for this LP primal problem

(Max Z = 9000x + 6000y, 60,000x + 40,000y ≤ 3,000,000, 650x + 300y ≤ 20,000)

Question 3

The following is the optimal simplex tableau for the linear programming problem of a company
manufacturing two products X1 and X2. S1 S2 and S3 are the slack variables of the three
resources A, B and C respectively involved in the manufacturing process.

Cj Solution 40 30 0 0 0 Quantity
Mix X1 X2 S1 S2 S3
X2 0 1 3.33 0 -2.22 20
S2 0 0 -0.67 1 0.44 1
X1 1 0 -1.67 0 2.78 25
Zj
Cj-Zj

a) Complete the above simplex tableau.

b) State the optimal solution including the total profit.
c) Is it worthwhile to purchase additional units of resource A at a cost of RM35.00 per unit?
Why?
(X1 = 25, X2 = 20, Profit, Z = RM1600, shadow price RM33.10)

1
ZAK / NMY @ UiTM Terengganu
Question 4

The optimal simplex tableau for the linear programming problem is given in the following table:

Cj Solution 12 15 14 0 0 0 Quantity
Mix X1 X2 X3 S1 S2 S3
S1 0 0 -1 1 2 -3 12
X2 0 1 1 0 1 -0.5 16
X1 1 0 0 0 -1 1 4
Zj
Cj-Zj

Where,
X1 = number of units of Product 1 produced per week
X2 = number of units of Product 2 produced per week
X3 = number of units of Product 3 produced per week
S1 = Slack variable for labour hours in Department A
S2 = Sack variable for labour hours in Department B
S3 = Slack variable for labour hours in Department C

a) Complete the optimal simplex tableau.

b) Determine the optimal production level and the maximum profit obtained.
c) The firm is considering hiring an extra labour on a part time basis at a rate of RM3.50 per
hour in Department C. What would be the daily profit obtained by the firm? (Assume the
firm operates 8 hours daily).

(X1 = 4, X2 = 16, X3 = 0, Profit, Z = RM288, The daily profit obtained = RM8)

Question 5

Takio Company produces two types of hand calculator: Business Calculator and Scientific
Calculator. The company wants to determine the number of each model to be produced per
month so that the profit will be maximized. The selling price of each Business Calculator is RM15
and of each Scientific Calculator is RM25, while the cost of manufacturing each Business
Calculator is RM11 and RM19 for each Scientific Calculator.

The company produces its own circuit boards to be used in the production of Business Calculator
and Scientific Calculator. It has the capacity to produce at most 61,000 basic circuit boards per
month. One circuit board is used in each production of Business Calculator and three circuit
boards are used in each of Scientific Calculator. Assembly time required to produce each
Business Calculator and Scientific Calculator are 0.2 hour and 0.25 hour respectively. Currently
the company has 8000 hours of assembly time available per month. The marketing manager has
undertaken a detailed study of the potential demand of the products and found out that the
demand for Business Calculator is at least 35,000 units per month.

Formulate this problem as a linear programming model.

(Max Z = 4x + 6y, x + 3y ≤ 61,000, 0.2x + 0.25y ≤ 8,000, x ≥ 35,000)

2
ZAK / NMY @ UiTM Terengganu
Question 6

Solve the following linear programming problem graphically, using the corner point method.

Minimize Cost = 1 X1 + 2 X2
Subject to
1 X1 + 3 X2 ≥ 900
8 X1 + 2 X2 ≥ 1600
3 X1 +2 X2 ≥ 1200
X2 ≤ 700
X1 , X2 ≥ 0

(X1 = 257.1, X2 = 214.3, Min C = RM685.70)

Question 7

Find the dual for the linear programming given below.

Maximize 10 x1 + 9 x2 + 4 x3 + 6 x4
Subject to
3x1 + 2x2 + 4x3 + 2x4 ≤ 70
5x1 + 5x2 + 1x3 + 3x4 ≤ 60
5x1 + 6x2 + 3x3 + 1x4 ≤ 25
x1, x2, x3, x4 ≥ 0

(Min C = 70 U1 + 60 U2 + 25 U3 )

Question 8

Given the following final simplex tableau of a manufacturing firm:

Cj Solution 150 130 250 0 0 0 0 0 Quantity

Mix
X1 X2 X3 S1 S2 S3 S4 S5
0 S3 0 0 0 0.25 0.25 1 0 -0.5 56.25
150 X1 1 0 0 0 1 0 0 0 250
250 X3 0 0 1 -0.25 -0.25 0 0 0.5 143.75
0 S4 0 0 0 -0.25 -0.25 0 1 -0.5 243.75
130 X2 0 1 0 1 0 0 0 0 375
Zj 150 130 250 67.5 87.5 0 0 125
Cj-Zj 0 0 0 -67.5 -87.5 0 0 -125

a) What is the quantity of each product (X1, X2 and X3) that will be produced?
b) Determine the total profit.
c) Interpret the shadow price for Resource 5.
d) State the resource(s) that is or are not fully utilized.

(X1= 250, X2 = 375 and X3 = 143.75, RM122,187.50, Shadow Price RM125, Resource 3 & 4)

3
ZAK / NMY @ UiTM Terengganu
Question 9

A linear programming model for the daily production of product 1 (x), product 2 (y), and product
3 (z) is given below:

Maximize P = 6x + 9y + 6z
Subject to :
2x + 2y + z  200 units (resource A)
2x + 4y + 3z  320 units (resource B)
2x + 5y + z  420 units (resource C)
x,y,z  0
where P = profit (RM)

a. Write the dual for the above linear programming model.

b. Set up the initial simplex tableau for the above problem.

c. The incomplete final simplex tableau for the above problem is shown below.

i. Complete the above simplex tableau.

Cj 6 9 6 0 0 0
Solution Mix x y z S1 S2 S3 Quantity
z 0 1 1 -0.5 0.5 0 60
x 1 0.5 0 0.75 -0.25 0 70
S3 0 3 0 -1 0 1 220
Pj
C j – Pj 0 0 0 -1.5 -1.5 0

ii. Determine the optimal daily production of the three products. What is the total
profit?

iii. How many units of each resource are used in the optimal production?

iv. What will be the effect on the optimal production if the manufacturer could obtain
only 250 units of resource C? Justify your answer.

v. Is there any alternative solution exists? Why?

4
ZAK / NMY @ UiTM Terengganu