BMT1014 Managerial Mathematics

Tutorial 3 Linear Programming

Trimester I 2015/2016

ANSWER ALL QUESTIONS

1) Consider the following system of inequalities. Graph each system and indicate
whether the solution set (feasible region) is bounded or unbounded.
(a) 2 x 2 y

(b)

2x 3 2 y

x y 1
3x 5 y
y 2x

2) Solve each linear programming problem by method of corners.

a) Maximize Z 4 x 6 y
Subject to y 7

3x y 3
x y 5
x 0, y 0

b)

Minimize C 5x 3 y
Subject to x y 48

x 3 y 60
9 x 5 y 320
x 0, y 0

3) National Business Machines manufactures two models of fax machines: A and B.

Each model A costs $100 to make, and each model B costs $150. The profits are $30
for each model A and $40 for each model B fax machine. The total number of fax
machines demanded per month does not exceed 2500 and the company has earmarked
no more than $600, 000 per month for manufacturing costs.
a) Formulate the linear programming (LP) problem, assuming that the company
wants to maximize its profit.
b) Solve the LP problem formed in 3(a).
c) How many units of each model should National make each month in order to maximize
its monthly profit?

d) What is the optimal profit?

4) Everest Deluxe World Travel has decided to advertise in Sunday editions of two
major newspapers in town. These advertisements are directed at three groups of
potential customers. Each advertisement in Newspaper I is seen by 70,000 group A
customers, 40,000 group B customers and 20,000 group C customers. Each
advertisement in Newspaper II is seen by 10,000 group A customers, 20,000 group B
customers and 40,000 group C customers. Each advertisement in Newspaper I costs
$1,000 and each advertisement in Newspaper II costs $800. Everest would like their
advertisements to be read by at least 2 million people from group A, 1.4 million from
group B and 1 million from group C. How many advertisements should Everest place
in each newspaper to achieve its advertisement goals at a minimum cost? What is the
minimum cost?