Scribd
Upload
29 views8 pages

Linear Programming

The document discusses linear programming and using inequalities to define regions on a graph. It provides examples of defining regions using multiple inequalities and finding the maximum or minimum value of an objective function within the defined region.

Uploaded by

aseda.stanhopeessamuahp6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
29 views8 pages

Linear Programming

The document discusses linear programming and using inequalities to define regions on a graph. It provides examples of defining regions using multiple inequalities and finding the maximum or minimum value of an objective function within the defined region.

Uploaded by

aseda.stanhopeessamuahp6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 8

LINEAR PROGRAMMING

Reminder:

You can represent an inequality on a graph.


There are some important rules to follow.

• If the inequality is ≥ or ≤ the boundary line for the region


is shown by a solid line.
• If the inequality is > or < the boundary line for the
region is shown as a broken (dashed) line.
• You are expected to shade the unwanted region. (This
will leave the required region clear.)
Examples y x3
1 x≥3 y>2 x+y≤8 10

a Show the points with integer


coordinates that satisfy all 8
three inequalities.

Remember to shade the 6


unwanted regions.
4
First show x ≥ 3.
Next show y > 2.
Then show x + y ≤ 8. 2 y2

xy 8 x 0 8
y 8 0 x
0 2 4 6 8 10
xy 8
Now show the points with integer coordinates that satisfy
all three inequalities on the diagram.
y x3
b For the points in part a, 10
find the maximum value
of 2x + y.
8

Put the points into a table


and calculate the value of 6
2x + y at each point.
x y 2x + y 4
3 3 6+3= 9
4 3 8 + 3 = 11 2 y2
5 3 10 + 3 = 13
3 4 6 + 4 = 10 x
0 2 4 6 8 10
4 4 8 + 4 = 12 xy 8
3 5 6 + 5 = 11 The maximum value of 2x + y is 13.
(The maximum occurs at the point (5, 3).)
It is important to note that the maximum or minimum
values always occur at/near the
corners of the required region
Examples y
x 1 yx
2 x≥1 y≥x 4x + 5y ≤ 40 10

a Show the points with


integer coordinates that 8
satisfy all three inequalities.

Remember to shade the 6


unwanted regions.
4
First show x ≥ 1.
Next show y ≥ x.
Then show 4x + 5y ≤ 40. 2

4x  5y  40 x 0 10
y 8 0 x
0 2 4 6 8 10
4x  5y  40
Now show the points with integer coordinates that satisfy
all three inequalities on the diagram.
Examples y
x 1 yx
10
b For the points in part a,
find the minimum value
of 10x + 3y. 8

Put the ‘corner’ points into


a table and calculate the 6
value of 10x + 3y at each
point.
4
x y 10x + 3y
1 7 10 + 21 = 31
2
1 1 10 + 3 = 13
4 4 40 + 12 = 52 x
0 2 4 6 8 10
4x  5y  40
The minimum value of 10x + 3y is 13.
(The minimum occurs at the point (1, 1).)
Examples y yx
x2
10
3 Zoe buys x lemons and y oranges.
She must buy at least 2 lemons.
She must buy more oranges than lemons. 8
She must buy a total of at least 8 lemons R
and oranges.
a Write down three inequalities in x and y. 6
x2 yx xy 8
4
b On the graph show the region R
that represents these 3 inequalities.
2
c A lemon costs $1 and an orange
costs $2. Find the smallest amount
of money that she spends. x
0 2 4 6 8 10
At (2, 6) Cost = 2 × 1 + 6 × 2 = $14 xy 8
At (3, 5) Cost = 3 × 1 + 5 × 2 = $13 Remember that the maximum or minimum
values always occur at/near the
At (4, 5) Cost = 4 × 1 + 5 × 2 = $14 corners of the required region.

You might also like