0% found this document useful (0 votes)
11 views16 pages

Linear Programming 18 Exercises (Minus 2)

This summary describes 8 linear programming exercises. Exercise 1 involves graphically representing a system of inequalities and determining if certain points are solutions. Exercise 2 deals with maximizing an objective function subject to constraints. Exercises 3-7 present similar maximization/minimization problems with constraints. Exercise 8 seeks the maximum number of pens and notebooks that can be purchased with a given budget.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views16 pages

Linear Programming 18 Exercises (Minus 2)

This summary describes 8 linear programming exercises. Exercise 1 involves graphically representing a system of inequalities and determining if certain points are solutions. Exercise 2 deals with maximizing an objective function subject to constraints. Exercises 3-7 present similar maximization/minimization problems with constraints. Exercise 8 seeks the maximum number of pens and notebooks that can be purchased with a given budget.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

LINEAR PROGRAMMING EXERCISES

Exercise No. 1.-

a) Draw the area formed by the points that meet the following conditions:

y 3
y x 1
y 3x 0

b) Indicate whether the points (0, 0), (2, 1), and (1, 2) are part of the solutions of the system.
anterior.

Solution:

y 3
a) We represent the lines y x 1 y x 1
y 3x 0 y 3x

We take any point; for example, (1, 0), to verify what the
points that satisfy the proposed inequalities.

The sought venue is:

b) In light of the previous graph, we have that (0, 0) and (2, 1) are not solutions of the
system, but (1, 2) is.

Exercise No. 2.

Maximize the function z=x and subject to the following restrictions:

x 3y 26
4x 3y 44
2x 3y 28
x 0
y 0
Solution:

x 3y 26 y 26 x
3
44 4x
We represent the lines 4x 3y 44 y
3
28 2x
2x 3y 28 y
3

and we find the region that meets the conditions of the problem, taking into account that
x 0 ey 0.

We represent the direction of the lines z=x and drawing the one that passes through the origin of
coordenadas:x y = 0

4x 3y 44
ElpuntoM, intersection of that is, M  8,4  it is the one that provides
2x 3y 28

the maximum, which is: z= 8 4 = 12

Exercise No. 3 -

On a chicken farm, a 'fattening' diet is provided with a minimum composition of 15.


15 units of substance A and another 15 of substance B. In the market only is
two classes of compounds are found: type I with a composition of one unit of Ay
five of B, and type II with a composition of five units of A and one of B. The price
Type I is 10 euros and Type II is 30 euros. The question is:
What quantities need to be purchased of each type to meet the needs at a cost
minimum?

Solution:

We call units purchased of type I and those purchased of type II.


Let's summarize the data in a table:
The restrictions are:

x 5y 15
5x y 15
x 0
and 0

The function that gives us the cost is z = 10x 30y = 10(x 3y).

We must minimize this function, subject to the previous constraints.

We draw the area corresponding to the constraints, and the line 10(x 3y) = 0
x 3y = 0, which gives us the direction of the lines z = 10(x 3y).

x 5y 15
The minimum is reached at the point of intersection of that is, in (2.5; 2.5).
5x y 15

Therefore, you need to buy 2.5 of type I and 2.5 of type II.

The price in this case will be z = 10(2.5 3 2.5) = 100 euros.

Exercise No. 4.

We have 210,000 euros to invest in the stock market. We are recommended two types of
stocks. Type A yields 10% and Type B yields 8%. We decided
invest a maximum of 130,000 euros in type Ay, with a minimum of 6,000 euros in
type B. Furthermore, we want the investment in type A to be less than or equal to the
double the investment in B.

What should the investment distribution be to obtain maximum annual interest?

Solution:

We call the money we invest in type Aeyal stocks that we invest in the
of type B.
We summarized the data in a table:

The restrictions are:

x y 210000
x 130000
y 6000
x 2y
x 0
y 0

The function that gives us the total yield is:

1 2 1
z 0.1x 0.08y  10x 8y   5x 4y   5x 4y .
100 100 50

We must maximize this function, subject to the above constraints.

We draw the area corresponding to the constraints (the unit is 10000)


1
and the line  5x 4y  0 5x 4 years 0, gives us the direction of the lines
50
1
z  5x 4y  .
50

The maximum is reached at the point (13, 8).

Therefore, we must invest 130,000 euros in stocks of type Ay and 80,000 euros in those of
typeB. In this case, the annual benefit will be
1
z  5 130000 4 80000 19400 euros.
50

Exercise No. 5.

a) Represents the enclosure that meets these restrictions:


x 3y 9
2x y 8
x 0
y 0

b) Give three points that are a solution to the previous system.

Solution:

9 x
x 3y 9 y
3
a) We represent the lines 2x y 8 y 8 2x
x 0
y 0

We take any point, for example (0, 0), to check what the
points that satisfy the proposed inequalities.

The sought venue is:

(1, 1), (2, 2) and (2, 0).

Exercise No. 6.

Find the minimum of the function z = 3x 2y with the following restrictions:

3x 4y 12
3x 2y 2
x 0
y 0

Solution:

12 3x
3x 4y 12 y
4
We represent the lines
2 3x
3x 2y 2 y
2
and we find the region that meets the conditions of the problem, taking into account that
x 0 ey 0.

The vertices of that region are the points:

2
 0,1  ;  0,3  ;  4,0  y ,0
3

We represent the direction of the lines z = 3x. 2y, drawing whatever goes through the origin
of coordinates: 3x 2y = 0

We observe that the line 3x 2y = 0 and the line 3x 2y = 2 are parallel. Therefore,
2
the minimum is reached at all points of the segment that joins  0,1  y , 0.
3

This minimum is worth:

z=3 0 2 1 = 2

Exercise No. 7.

A certain manufacturer produces two items, A and B, for which it requires the use of two
production sections: assembly section and painting section.
The item requires one hour of work in the assembly section and two in the painting section; and
item B, three hours in the assembly section and one hour in the painting section.

La sección de montaje solo puede estar en funcionamiento nueve horas diarias, mientras
that painting only eight hours a day. The benefit obtained by producing the
base articles of 40 euros and the Aes of 20 euros.

Calculate the daily production of items A and B that maximizes profit.

Solution:

We call the daily production of articles A as that of articles B. We summarize the


data in a table:
The restrictions are:

x 3y 9
2x y 8
x 0
y 0

The function that gives us the profit is z = 20x 40y = 20(x 2y). We must obtain the
maximum of this function,subject to the previous constraints.

We draw the area corresponding to the restrictions and the line 20(x 2y) = 0
x 2y = 0, which gives us the direction of the lines z = 20x 40y.

x 3y 9
The maximum is reached at the point of intersection of the lines. ;
2x y 8
that is, at (3, 2).

Therefore, 3 units of A2 of B must be produced. In this case, the profit will be


z= 20 3 40 2 = 140 euros.

Exercise No. 8.

A kiosk sells pens for 20 cents and notebooks for 30 cents.


We have 120 cents of a euro and we intend to buy the same notebooks as
pens, at least. What will be the maximum number of pieces we can buy?

Solution:

We called the number of pens and the number of notebooks.


We have to:

The restrictions are:


20x 30 years 120 2x 3y 12
x y
x 0
y 0
x,y integers

We draw the corresponding enclosure. The possible solutions are the points that appear.
marked:

We must maximize the number of pieces, that is, we must maximize z=x. y.
We see that there are three points that maximize this sum: (0, 4), (1, 3), and (2, 2). The
the maximum number of pieces we can buy is 4.

Exercise No. 9.

a) Graphically represent the solution set of the following system of


inequalities:

6x y 1
x y 1
y 2

b) Tell me if the points (0, 1), (0, 0), and (0, 3) are solutions to the previous system.

Solution:

6x y 1 y 6x 1
a) We represent the lines x y 1
 y 1
 x
y 2

We take any point; for example (0, 0), to check what the
points that satisfy the proposed inequalities.

The sought-after venue is:


(0, 1) is indeed a solution of the system, (0, 0)
it is too, but (0, 3) is not.

Exercise No. 10.

Maximize the function z= 150x 100y, subject to the following restrictions:

2x 3y 600
2x y 480
x 0
y 0

Solution:

600 2x
2x 3y 600 y
3
We represent the lines
2x y 480 y 480 2x

and we find the region that meets the conditions of the problem, taking into account that
x 0 ey 0.

The vertices of that region are the points:

(0, 0); (0, 200); (240, 0) y (210, 60)

We represent the direction of the lines z = 150x 100y, drawing the one that goes through the
origin of coordinates: 150x 100y = 0

The maximum is at the vertex (210, 60), where z = 150 210 100 60 =
= 37500.
Exercise No. 13.

a) Build the solution set of the following system:

3x 3y 120
3x 6y 180
x 0
y 0

b) The points (20, 10), (20, 0), and (20, 20) are part of the solutions of the system.
previous?

Solution:

3 x 3 years 120 x y 40 y 40 x

180 3x x
3 x 6y 180 y y 30
a) We represent the lines 6 2
x 0

y 0

We take any point, for example (0, 0), to check what the
points that satisfy the proposed inequalities.

The sought venue is:

b) In view of the previous graph, we have that the three points are solutions of the system.

Exercise no. 14.

a) Draw the area defined by:


 2x y 3
2x y 2
x 2y 4

b) Find the vertices of the previous enclosure.

c) Find the maximum of the function z = 4y  x, subject to the restrictions proposed in a).
What point of the enclosure reaches that maximum?

Solution:

 2x y 3 y 2x 3
We represent the lines 2x y 2 y 2x 2
4 x
x 2y 4 y
2

and we find the region that meets the conditions of the problem.

The vertices of the enclosure are the points:

 2 11 8 6
A , y B
5 5 5 5

We represent the direction of the lines z = 4yx, drawing the one that passes through the origin
of coordinates: 4yx= 0

 211
The maximum is reached at point A , and it's fine:
5 5

11 2 44 2 46
z 4   9.2
5 5 5 5 5

Exercise No. 15.

A department store wants to liquidate 200 shirts and 100 pants from the season.
anterior. Para ello, lanzan dos ofertas, AyB: La ofertaAconsiste en un lote de una
shirt and a pair of pants, which are sold for 30 euros; offer B consists of a batch of three
shirts and a pair of pants, which are sold for 50 euros. It is not desired to offer less than 20 lots of
the offer Ani less than 10 of the B.
How many lots of each type should they sell to maximize profit?

Solution:

We call the number of lots of A the number of lots of B.


We summarize the data in a table:

The restrictions are:

x 3y 200
x y 100
x 20
y 10

Maximizing profits is equivalent to maximizing revenues.

The function that gives us the income is z = 30x 50y = 10(3x) We must obtain the
maximum of this function subject to the previous constraints.

We draw the corresponding area for the constraints and the line.
30x 50y = 10(3x 5y) = 0 3x 5y = 0, which gives us the direction of the lines
z = 30x 50y.

x 3y 200
The maximum is reached at the intersection point of the lines. ;
x y 100
that is, at (50, 50).

Therefore, 50 batches of offer A and 50 of B must be made. The income in this case
they would be from z= 30 50 50 5
 0 = 4000 euros.

Exercise No. 16.

Three chemical elements are desired from the substances A and B. One kilo of A.
contains 8 grams of the first element, 1 gram of the second and 2 of the third; a kilo of B
It has 4 grams of the first element, 1 gram of the second, and 2 of the third. It is desired to obtain
at least 16 grams of the first element and the amounts of the second and the third must be
be at most 5 and 20 grams, respectively; and the amount of Aes at most the
double that of B.

Calculate the kilos of A and B that should be taken so that the cost is minimized if a
a kilo of Avale 2 euros and one of B10 euros.
Can any restriction be removed?

Solution:

We call the kilograms of Aeya those of B.

We summarize the data in a table:

The restrictions are:

8x 4y 16 2x y 4
x y 5
2x 2y 20 x y 10 (This can be deleted, since, if x y 5
necessarily,x y 10)
x 2y
x 0
y 0

The function that gives us the cost is z = 2x 10y = 2(x We must minimize this
function, subject to the above restrictions.

We draw the enclosure corresponding to the restrictions and the line 2(x 5y) = 0
x 5y = 0, which gives us the direction of the lines z = 2x. 10 years.

2x y 4
The minimum is reached at the intersection point of the lines ;
x 2y
that is, in (1.6; 0.8).

Therefore, 1.6 kilos of A and 0.8 of B must be bought. The cost in this case will be
z=2 1.6 10 0
 .8 = 11.2 euros.

Exercise No. 17.-

A factory produces utility and luxury refrigerators. The factory is divided into two sections:
assembly and finishing. The work requirements are provided by the following table:

The maximum number of work hours available daily is 120 in assembly and 180
in finishing, due to the limitations of operators.
If the profit is 300 euros for each utility refrigerator and 400 euros for each refrigerator of
luxury, how many should be produced daily of each to obtain the maximum profit?

Solution:

We call xalnoof utility refrigerators and stoveoluxury refrigerators.


We summarized the data in a table:

The restrictions are:

3x 3y 120 x y 40
3x 6y 180 x  2y 60
x 0
y 0

The function that gives us the profit is z = 300x. 400y = 100(3x We must obtain the
maximum of this function, subject to the previous constraints.

We draw the area corresponding to the constraints and the line 100(3x 4y) = 0
3x 4y = 0, which gives us the direction of the lines z = 300x 400 yards
x y 40
The maximum is reached at the intersection point of the lines: ;
x 2y 60
that is, at (20, 20).

Therefore, 20 refrigerators of each of the two types must be manufactured. The profit will be
z= 300 20 400 2
 0 = 14000 euros.

Exercise no. 18.

La casa Xfabrica helados AyB, hasta un máximo diario de1000 kilos. La fabricación de
One kilo of A costs 1.8 euros and one of B costs 1.5 euros. Calculate how many kilos of A and B.
they must be manufactured, knowing that the house has 2700 euros/day and that a kilo of Adeja
a margin equal to 90% of what a kilo of B leaves.

Solution:

We call Aeya's kilos those of B. Give me the margin of B; then that of A.


it is 0.9m.
We summarize the data in a table:

The restrictions are:

x y 1000
1.8x 1.5years 2 7 0 0
x 0
y 0

The total margin is z= 0.9mx mx=m(0,9x This is the function that we must
maximize, subject to the previous constraints.

We draw the area corresponding to the constraints and the line m(0,9x y) = 0
0.9x y = 0, which gives us the direction of the lines z = m(0,9x) y).

We observe that 1.8x 1.5 years 2700 does not impose any new restrictions. The maximum is
reaches at point M(0,1000).

Therefore, 1000 kilos of type By ice cream must be produced, none of type A.

You might also like