LINEAR PROGRAMMING·

8
8-1 REVISION OF INEQUATIONS
The symbols used for describing inequations may be listed as:

> ♦ greater than eg. y > �x + 3

� ♦ greater than or equal to eg. y � $x 4
♦
'
< less than e<j. y < �
� ♦ less than or equal to eg. y 4x -6

The solution to an inequation involves an infinite number of points and

is represented as a. region on a graph.

Inequations with signs of� or� are represented by li:Q.'es drawn in

full strength.
Inequations with signs of < or > are shown as broken lines.

EXAMPLES:
Eg.l y � 2x + 3 Eg.2 y < -x + 5 Eg.3 -2x + y �-6

PROBLEMS:
1. Sketch the solution regions of the· following inequations.
a) y � x b) y < 2x + 3 c) y � x - 5 d.) y > -2x
e) f) X .('. 5 g) y � -6 h) x t -2
#i) j) 2x - y < 8 k) 2y + x ' 4 1) 2y > 4x - 10
t These graphs are conveniently sketched using the intercept method.
ie. Put x = 0 to find they intercept, then put y = 0 to find the
x intercept.
2. Write down the inequations representing each of the following regions.
c)
y '

X X X

----<-!.
 - 104 -

8-2 SOLUTION REGIONS FOR SYSTEMS OF INEQUATIONS

3x
Consider the set of inequations y, 2 y � -x + 5 and y � 0
The individual· solutions are represented as regions on graphs as shown below:

y REGION FOR
Y�O

X X
SOLUTION
REGION
Jx
y' 2

The simultaneous solution for the set of inequations is described in

set notation.as:
{(x,y): Y, 3x} ra {(x,y): y' -x + 5} f\ {(x,y): y � O}
2
and is represented graphically as a common region as shown.

TERMINOLOGY
The 3 inequations represent the
4 ION REGION for the restrictions placed on x and y
m of inequations:
values.
3 y,-x+5
The restrictions (ie. inequations)
2 are sometimes referred to as
constraints.
The region in.this example is
X
bounded on all sides forming a
2 3
finite solution region.

EXERCISE: Use set notation to describe.each of the following regions

on . the graph •.
a) the unbounded region B.
b) the unbounded region C.
c) the bounded region D.
d) the bounded region including A and D.
e) the unbounded region incl,uding B and C.

PROBLEMS:
1. Sketch the solution regions to the following systems of ineq�ations
and state whether or not the region is bounded.

a) X < 5, X > -2 b) y � o, X � o, X " 6

c) X � o, y � o, X � Ei, y � 6 d) Y· :) x, X � o, X " 5
e) X + y " 4, y - X � o, X � 0 f) 4y - 4x < 12, X + y < 4, X ). -2 ,Y�o
 - 105 -

8-2 PROBLEMS: Cont'd

2. Solve graphically:
a) y) :
{ ( X, y<x+2 } fl {(x,y): x�O} f'\ {(x,y): x,4} f'\ {(x,y): y�O}
b) {(x,y): y�x .} ('\ {(x,y): y<-x+6} ('\ {(x,y): x;>-1} /'\ { (x,y): y)l }
c) {(x,y): y<x} (\ { (x,y): y>-x } f\ {(x,y): x <6}
d) { (x,y): y�-x+6} ('\ {(x,y): y�4} ('I {(x,y): x�l} ('\ { (x,y): y�O}
3. Sketch the solution region appropriate to the following set of
constraints.
a) y "- 4, y � -4, X ? 0, X "' 6
b) -4 � y � 4, 0 (:. X .(: 6

'
c) y �· -x + 10, y < 7, y � o, X (. 6, X ). 0
d) y � 4x, y � X + 9, y � 18, X 12, X � 0
e) y )2 , y > x, y � -x + 12, y ' 9, X � 0

8-3 INVESTIGATING SOLUTION REGIONS - MAXIMISATION/MINIMISATION

Consider the bounded solution region which satisfies the set of constraints.
y -' x + 8, y � 8, y � 0, and x 4 O
C
A sketch of the solution region is provided below.
y TASK:
.,Line y:8 We wish to determine the maximum value of
the expression P = 2x + 3y within the
:ine x: 10 .\ solution region. The values chosen for
x and y are restricted to the boundaries
X of the region or to any point within the
10 region.

SOLUTION:
The value of 'P' is determined for points
selected at random from the region.
EXAMPLES:
y
[fil x= -8, y=O ♦ P = 2(-8)+3(0)=-16+0 = -16
G C
I [fil x=O, y=8 P = 2(0)+3(8)=0+24 = 24
I
-- ----iI------ ,H
I
@ x=lO, y=8 p = 2(10)+3(8)='20+24 =1441
I
I
I @J x=lO, y=O P = 2(10)+3(0)=20+0 = 20
[!]
I
I
I
I
x=-·4, y=4 P = 2(-4)+3(4)=-8+12 = 4
[!I
I
I
I D x=-2,y=3 P = 2(-2)+3(3)=-4+9 = 5
B 1 X
@] x=4, y=8 P 2(4)+3(8)=8+24 = 32
@] x=8, y=6 ♦ P = 2(8)+3(6)=16+18= 34

Clearly the maximum value occurs at Point C where x = 10, Y = 8.

The maximum value is 44.

IN GENERAL, WHEN FUNCTIONS ARE TO BE MAXIMISED WITHIN A REGION, THE

HIGHEST VALUE WILL BE ASSOCIATED WITH A POINT'ON THE BOUNDARY RATHER
THAN WITH A POINT THAT .. FALLS WITHIN THE REGION.
 - 106 -

8-3 Cont'd
PROBLEMS:
1. For each of the labelled points situated on the boundary of the
solution region provided below, determine the value of the following
functions.
y -- A
a) p = 2x + y
4
b) F = 3x + 2y
c) R = 2x .,.. y
2
--£
d) s = Sx - 2y
2 4 6 D

2. For each of the regions below, determine the maximum and minimum
values possible for the given function.
a) FUNCTION: p = 4x + Sy b) FUNCTION: R = l0x - 6y
y y
5 5
4
·3 3
- . - - - ---r-
1 1
I .X
1 2 3 6 1 2 3 4 5 6 7

3. Graph the following set of constrainrs and so obtain a maximum value

for P = Sx + 4y t�at falls within the solution region.
CONSTRAINTS: y -� x, y � 5, y � -x + 15, x � 12, x � 0 , y -� 0

8-4 _METHOD FOR MAXIMISING OR MINIMISING FUNCTIONS

EXAMPLE 1 Functions with positive slope.

Consider an expression of the type F = 4x 2y (where F is a constant).
For a given value of IF', the expression translates into a linear function
ie. For F. = 0 ♦ 0 = 4x - 2y ♦ 2y = 4x OR y = 2x
For F = 6 ♦ 6 = 4x - 2y ♦ 2y = 4x - 6 OR y = 2x - 3
For F = -6 ♦ -6 = 4x - 2y ♦ 2y = 4x + 6 OR y = 2x + 3 ·
A sketch graph summarising the 3 results illustrates the family of
curves associated with different 'F' values. Observe that the graphs
are parallel.
NOTE:
For F = 0, the resulting linear graph
passes through the origin_.
For large 'F' values, the graph is
X translated downwards. (Eg. F=-+6)
For small 'F' values the graph is
translated upwards. (Eg. F=-6)
 - 108 -

8-4 Cont'd
PROBLEMS:
1. Find the maximum and minimum values for each function over the
regions provided.· NOTE: Since all of the functions have negative slope, maximums ar,e
obtained by translating the reference lines upwards.
a) P = 8x + 2y b) F = 2y + 3x c) R = 2y + 6x
y y
G

-2 6 X X X

2. Maximise the function M = 3x + 2y over the region that satisfies

the constraints y � ½x, x � 8, x � o, y � 10

8-5 LINEAR PROGRAMMING

Linear Programming is used to solve problems involving a number of
conditions that must be met simultaneously. The technique finds
application in industry and commerce where decisions need to be made
t-o achieve optimum results.
In particular, Linear Programming can prove.useful for making decisions
relating to production quotas, profitability, and best useage of available
man power and resources etc. In each case the optimum result always has
to take into account the various constraints and limitations that exist.

STEPS INVOLVED IN LINEAR PROGRAMMING:

Identify the variables.
List the constraints in the form of inequations.
Graph the constraints and define a solution region.
Identify the Boundary conditions that lead to optimum results.
Calculate the optimum result (ie. identify the required
maximum or minimum.)

EXAMPLE: A small company manufacturPS 2 types of underwater torch

batteries referred to.as 'Poseidashine' and 'Aquabrite'
cells. Due to limitations in the manufacturing process
no more than 10 Poseidashine batteries and no more than 8
Aquabrite batteries can be produced per shift.
Each Poseidashine battery involves 4 operators whilst
2 operators are able to assemble the simpler Aqu�brite
version. The assembly line can occupy no more than 48
workers per shift.
The profit per Poseidashine battery is $7.00, and the
profit per Aquabrite battery is $2.00.
REQUIRED: Determine the number of each type of battery
to be manufactured to return maximum profit.
 - llO -

8-5 Cont'd
PROBLEMS: Solve the following problems by applying the techniques of
Linear Programming.
1. A small book publisher produces a hard bound edition and a
paperback edition of a popular novel. It is not possible to
produce more than 500 copies of the novel per day.
Also, the number of hard bound editions produced on any day is
not to exceed half the number of paperback versions produced.
Assuming that all production can be sold, determine the number
of each type that should be produced to maximize profit, given
that the profit on hard cover books is $15 and that on paperbacks
is $10.
(Let x = no. of hard bound books, y·= no. of paperback books)

2. A car part manufacturer produces 2 types of tachometers; a high

speed type and a low speed type. There is sufficient stock supply
to produce up to 2 high speed and up to 4 low speed tachometers
per daf. It takes 3 technicians to make high speed tachometers
and 2 technicians for the low speed type. The company will
employ up to a total of 12 technicians.
On average, the number of low speed tachometers required is at
least l½ times the number of high speed types.
Determine the number of each type of tachometer to be produced
to achieve maximum profit, given that the profit figures are
$50 (low speed type) and $150 (high speed type) respectively.
(Let x = no. of high speed types and y = no. of low speed types)

3. A money box contains only 20¢ and 50¢ coins. There are at least
thirteen 50¢ coins and at least twenty six 20¢ coins.
If the total number of coins is not to exceed 81, and there are
to be at least twice as many 50¢ coins as there are 20¢ coins,
determine the maximum amount of money contained in the money box.
(Let x = no. of 20¢ coins, y = no. of 50¢ coins)

4, A wetsuit manufacturer produces two types of wetsuits, namely

a 3mm thick suit called 'Abalone', and a 5mm thick suit called
'Cray'.
A maximum of 30 suits can be manufactured per week. The owner
already has orders for 7 Abalone_ and ·10 Cray suits for the current
week. Usually the weekly sales of the 'Cray' are.more than double
that for·the 'Abalone'.
a) If the profit on the Abalone. suit is $30 and the Cray is $50,
how many of each suit should be produced for maximum profit?
b) Determine the maximum and minimum profit expected for the
current week.
(Hint: Let x = number of Abalone suits, and y = number of Cray
suits)

s. A Hong Kong tailor makes suede sports coats and cloth sports coats.
He is limited. to 21_ suede and 15 cloth coats per week. It takes
2 staff to produce su·ede coats and 3 staff to produce cloth coats.
However only a maximum of 60 staff can be hired over a weekly
period.
If the profit on a suede coat is $100, and the profit on a cloth
coat �s $75, determine the maximum weekly profit achievable.
(Let x = no. of suede coats, y = no. of cloth coats)
 - 111 -

8-5 Cont'd
PROBLEMS:

6, A toy bicycle manufacturer produces two types of cycle called the

RAM and the RIMMER. The factory has access to enough ·bike parts
to manufacture up to 200 bikes per week.
In a particular week, 40 RAMS and 75 RIMMERS are already ordered,
and it is expected that RIMMER sales will exceed RAM sales by
more than 50 cycles.
a) How many of each type should be manufactured for a maximum
profit, if the profit on each are $60 (RAMland $80 (RIMMER)?
b) Determine the maximum profit expected.
(Let x = no. of 'Rams' produced and y = no. of 'Rirnmers' produced)

7. A service station sells super grade petrol and diesel fuel

for 60¢ and 50¢ per litre respectively.
The station does not sel1 more than 10 000 litres in total per day,
but always manages to sell at least3000 litres in total per day.
The minimum sales for super grade petrol and diesel fuel per day are 2000
litres and 1000 litres respectively.
The amount of diesel fuel sold is never more than the amount of
super grade petrol sold.
Determine the maximum and minimum daily turnover that could be
achieved.
(Let x = no. of litres of super, y = no. of litres of diesel fuel)