CHAPTER 5

THE NATURE OF MATHEMATICAL

SYSTEMS

DHENNIZE MAE PINGOL

BSED 2-A1
Exercise:

1. Solve the given system by using either the substitution or the elimination method.

A. {35x −4 y =−2
x+ y=40

x=8 y=3

B. {−x+
2 x− y =6
8 y=12

x=384 y=12

C. {2x x− y+1=0
+2 y+ 4=0

y=2 x=4

D. {25x−3
x+2 y=8
y =7

x=32 y=-6

E. {x−2
2 x +7 y=4
y=−29

x=32 y=-6

F. {2x+3x + yy =11
=13

y=14 x=111

G. {23xx+4−6y=18
y=3

x=5 y=3

H. {26xx−7
+3 y=−16
y =80

x=4 y=-8

I. {45x−3
x +6 y=75
y =−18

x=3 y=10

J. {32xx− y =1
+2 y=19
 x=3 y=5

2. Solve the given system of inequalities by graphing.

A. {x−
x+ y ≤ 9
y≥1

{5 x + y ≤32
B. x+ y ≥ 12

{0.4 x +0.2 y ≤ 10
C. 0.2 x +0.4 y ≤ 14

{2 x + y ≤8
D. x + y ≥ 4

{
5 x +20 y ≥100
E. 15 x +10 y ≤150
32 x +8 y ≥ 16

{ y ≥ 4−2 x
F. y ≤ x−2

{ y <2−x
G. y ≥ 2 x−2

{3 x +2 y ≥6
H. 4 x− y ≥2

{ y +3 x ≥ 6
I. y−2 x ≤ 9

{
y ≥ x−5
J. 2 x +4 y ≤ 24
y ≤ 2 x +11

3. Find the coordinates of the vertices of the figure formed by each system of inequalities.

{
1
y ≤− x+ 6
4
A.
y ≥ x−8
4 y ≥ 8−15 x−32

{
2 x− y ≥−1
B. x + y ≤ 4
x+ 4 y ≥ 4

{
x+ y> 5
C. 2 x− y ≤ 4
y ≤7
 {
x + y ≥5
D. 2 x +3 y ≥12
y≥0

{
4 x+ y ≥ 12
E. 2 x +2 y ≤ 18
4 x−5 y ≤ 0

{
6 x−2 y ≤ 12
F. y−3 ≤ 0
x+ y ≥0

{
y ≥−2 x +8
G. y > x−1
x>1

{
2 x + y ≥3
H. 3 x− y ≤ 9
2 x + y ≤10

{
0.5 x +0.25 y ≥ 5
I. x +5 y ≥ 10
0.25 x+0.5 y ≤ 4

{
x+ 2 y ≤ 6
2 x− y ≤ 7
J.
x ≥−2
y ≥−2

4. Graph each system of inequalities. Then, find the coordinates of the vertices of the feasible
region.

{
−2 x −3 y ≤ 6
A. x− y ≤ 2
y≤2

{
x−2 y ≥ 6
B. x+ y ≤6
x≥0, y≥ x

{
x−2 y ≥ 6
C. x ≥ 0 , y ≥ x
y ≤ x+ 3

{
y+ 2 x ≥6
D. 2 ≤ x ≤5
y≥0

{
y ≥ x−3
E. 1≤ y ≤ 4
−x+ y ≤ 1
 {
2 x+ 4 y ≤ 9
F. 2 x− y 4
y−x , y 0 , x 0

{
2 x−3 y ≤6
x +3 y ≥3
G.
x −2 y ≥−2
2 x +3 y ≤ 10

{
2x+ y ≤2
H. x−4 y ≥−4
x+ y ≥ 1, y ≥ 0

{
x+ y ≥ 2
I. 4 y ≤ x +8
y ≥ 2 x−5

{
4 x− y ≤ 8
J. 2 x−3 y ≥−6
x≥0, y≥0

5. A feasible region of a system of inequalities has vertices at the given points. Find the maximum
and minimum values of the function f(x,y)=4x+5y.

A. A(0,0),B(5,0),C(0,6),D(3,6) MAXIMUM

B. A(0,2),B(1,0),C(3,2),D(3,5) MAXIMUM

C. A(0,1),B(11,3),C(10,1),D(6,3) MAXIMUM

D. A(1,2),B(1,4),D(5,2) MINIMUM

E. A(1,0),B(1,4),C(3,0) MINIMUM

F. A(0,0),B(0,3),C(3,0) MINIMUM

G. A(0,0),B(0,6),C(8,0),D(5,3) MAXIMUM

H. A(25,40),B(40,25),C(40,40) MINIMUM

I. A(3,0),B(2,2),C(2,8),D(6,0),E(6,0) MAXIMUM

J. A(1,2),B(1,4),C(5,2),D(5,8) MAXIMUM

6. Solve the following lp algebraically

A. Max z=150x+160y

Subject to:
 X +Y ≤ 50
X ≥ 20
Y ≥15
X , Y ≥0

B. MIN. Z= 2 x 1+ 3 x 2 + x 3

SUBJECT TO:

X 1 + X 2 ≥ 10

X 1 + X 3 ≥ 15

X 1 + X 2+ X 3 ≥ 20

6. For the following linear programming problems, formulate the linear programming model. Then,
find the optimal solution graphically for the LP with 2 only variables.

a. A hog raiser is mixing two types of grains A and B eac0 grams of fat and unit of grain a cost
50 and contains 20 grams of fat 10 grams of protein. Each unit of grain B costs 80 and
contains 30 grams of fat and 10 30 grams of protein. The hog raiser wants each unit of the
final product to yield at least 180 grams of fat and at least 120 grams of protein. How many
units of each type of grain should he use to maximize his sales?
b. Rabbits in the laboratories used for drug testing have to be fef daily diet for accurate
results.the diet must contain a minimum of 24 grams of fat , 36 grams of carbohydrate , and
4 grams of protein . the rabbits should be fed not more than five ounces of food per day . a
laboratory technician blends food X and food Y to produce an optimal mixture . food X
contains 8 grams of fat , 12 grams of carbohydrates , and 1 gram of protein per ounce at a
cost of 300 per ounce . what is the optimal blend to minimize the cost?
c. Barahan Plus Chemicals , Inc. produces two product that are sold as raw materials to
companies manufacturing bath soaps and laundry detergents . based on analysis of current
inventory levels and potential demand for the coming month , the company’s management
has specified that the combined production of products A and B must total at least 350
gallons . separately , a major customer’s order for 125 gallons of product A must be
satisfied. Product A 2 requires 2 hours of processing time per gallon while product B
requires 1 hour of processing time per gallon and for the coming month, 600 hours of
processing time are available. Barahan Plus Chemicals ‘ objective is to satisfy these
requirements at a minimum total production cost. Production costs are 80 per gallon
product A and 120 per gallon for product B. formulate a linear programming model that will
find the minimum –cost production schedule.
d. A farmer has 5 hectares of land to plant with rice and corn, he needs to decide how many
hectares of rice and corn to plant . he can make 200,000 profit per hectare planted to rice
and 250,000 profit per hectare planted with corn. However , the corn takes 2 hours of labor
per hectare to harvest the rice takes 1 hour per hectare. The farmer has 8 hours of labor to
harvest .to maximize his profit , how many hectares of each should be plant?
e. A television producer designed a program that will include a comedy and advertisement .
the advertiser insists on at least 4minutes of advertising time. The producer insists on not
more than 8 minutes of advertisement. The comedian insists on at least 5minutes of the
comedy portion. The total time allotted for comedy and advertisement cannot exceed one
hour. If it has been determined that each minute of advertising attracts 400,000 viewers and
each minute of the comedy program attracts 405,000 viewers, how many minutes should
be given to each of the comedy and advertisement in order to maximize the number of
viewers?
 f. A construction company manufactures bags of concrete mix from beach sand and river
sand. Each cubic meter of beach sand cost 60 and contains 4 units of fine sand , 3units of
coarse sand, and 5 unit of gravel. Each cubic meter of river sand costs 100 and contains 3
units of fine sand , 6 unit of coarse sand, and 2 units of gravel . each bag concrete must
contain at least 12 units of fine sand , 12 units of coarse sand, and 10 unit of gravel . find
the best combination of beach sand and river sand which will meet the minimum
requirements of fine sand, coarse sand, and gravel at the least cost.
g. A nutritionist serves lunch consisting of two dishes , A and B . assume each unit of dish A
has 2 grams of fat , 2 grams of carbohydrates and 8 grams of protein. Each unit of dish B
has 4 grams of fat , 2 grams of carbohydrates and 12 grams of protein . if the nutritionist
wants to provide not more than 20 grams of fats and not more than 14 grams of
carbohydrates , how many units of A and how many units of B should be served to
maximize the amount of protein consumed ?
h. A factory produces two types of fertilizer :X and Y . the profits realized from kilo of each of
the types are 80 and 90 , respectively . the raw materials from which the fertilizers are
made are nitrogen , sulfur, and potassium which are used in the following quantities:
Nitrogen Sulfur Potassium
X 3 3 8
Y 3 2 1

The available stocks include 1,500 kilograms of nitrogen , 1,300 kilograms of sulfur , and
1,200 kilograms of potassium . the objectives is to maximize the profit . find the amounts of
fertilizers X and Y to be manufactured.

i. Madam dorie owns a perfume where she mixes her own brands. Currently , she is offering
two brands- Halimuyak and Sweet smell . Halimuyak gives her a profit of 20 an ounce while
sweet smell gives her 16 of profit per one ounce. These two brands are mixed from two
essences E1∧E 2 .Mixing requirements are given in the following table:
E1 E2
Halimuyak 0.3 oz 0.1 oz
Sweet smell 0.1 oz 0.4 oz

Marie Dorie discovered that for a particularly day, she had 30 ounces of E1 and 60 ounces
of E2. What should she mix to maximize her profit?

j. Tow machines , A and B produce items at the rate of 50 units per hour and 40 units per
hour respectively. Under certain production plan, the total number of items needed is at
least 1,000 items, the total number of hours available for running the machines is at most
24 hours . if the hourly cost is 300 for machine A and 250 for machine B , how many hours
should each machine be used in order to minimize the cost?

7. Solve the LP algebraically.

a. Max Z =150X + 160Y
Subject to:
X+Y≤50
X≥20
Y≥15
X,Y≥0

b. Min Z =2 x 1+ 32+ x3
Subject to:
x 1+ x2 ≥10
x 1+ x3 ≥15
x 1+ x2 + x 3 ≥20
 x 1+ x2 + x 3 ≥0

Z = X 1 + X 2+ X 3 +05 +05 +05 +0 5 + 05

1 2 2 3 4

X 1 + X 2+ 05 =0 1

X 1 + X 3+ 05 + 05 =15 1 2

X 1 + X 2+ X 3 +05 +05 +05 =20 1 2 3

X 1 +21 + X 3 + 05 + 05 + 05 +05 =0
1 2 3 4

c. Min Z =50 x 1+40 x 2

Subject to:
2 x 1+ x2 ≥12
2 x 1+ 9 x2 ≥36
2 x 1+ 3 x 2 ≥24
x 1 , x 2 ≥0

z= X 1+ X 2+ 05 +05 +05 + A1 + A 2+ A 3
1 2 3

2 X + X 2 −05 + A 1=12
1 1

2 X +9 X −0 5 + A 2=36
1 2 2

2 X +3 X −05 + A 3=24
1 3 3

X 1 X 2 −05 + A 3=0 4

d. Min Z =10 x 1+30 x 2+ 40 x 3+ 20 x 4

Subject to:
x 1+ x3 ≥20
x 1+ x2 + x 3 +4 ≥50
x 1 , x 2 , x 2 , x 4 ≥0
Z=X 1 + X 2 + X 3 + X 4 +05 +0 5 + 05 1 2 3

X 2 +Y 3 +0 5 =20 1

X 1 + X 2+ X 3 + X 4 + 05 +05 =50 1 2

X 1 + X 2+ X 3 + X 4 + 05 +05 +05 =20 1 2 3

e. Max Z = 30 x 1+ 40 x2
Subject to:
x 1+ 2 x 2≤12
- x 1+ 2 x 2 ≤8
2 x 1+ x2 ≥16
x 1 , x 2 ≥0
Z=X 1 + X 2 +05 +05 +0 5 + MA 1−MA 2
1 2 3

X 1 +2 X + 05 =12 2 1

−X 1 +2 X + 05 +05 =8 2 1 2

2 x + X 2 −05 + A 1=16
1 3

X 1 +2 X −05 + A 2=0 2 4

f. Max Z = 650X +910Y

 Subject to:
15
4X+ Y≤105
2
31 49
X+ Y≤90
5 10
91 41
X+ Y≤100
10 10
X,Y≥0

g. Max Z = 5 x 1+ 2 x 2 +8 x3
Subject to:
1
x 1−2 x2 + x 3 ≤420
2
x
2 1 + 3 x 2 −x 3 ≤610
6 x 1−x 2+ 3 x 3≤125
x 1 , x 2 , x 3 ≥0

z= X 1 X 2 X 3 05 05 05 0 5 + MA 1
1 2 3 4

+1
X 1 ±2X +0 =420
2 X 5 1

1
2 X +3 X − X 3 +05 +05 =610
2X 1 2

6 X ± X 2 + X 3 +0 5 +0 5 05 05 =125
1 1 2 3

X 1 + X 2+ X 3−0 5 + A 1=0 4

h. Min Z = 30 x 1+ 40 x2
Subject to:
x 1+ 3 x 2 ≥6
x 1+ x2 ≥4
x 1+ 2 x 2 ≤8
x 1 , x 2 ≥0
z= X 1 + X 2+ 05 +0 5 +05 +05 −MA 1
1 2 3 4

X 1 +3 X −0 5 + A 1=6
2 1

X 1 + X 2−05 + A2=4 2

X 1 +2 X +0 5 =8
2 3

X 1 + X 2−0 5 + A 3=0 4

i. Min Z = 30 x 1+ 40 x2
Subject to:
10 x 1+ 30 x 2 ≤120
30 x 1+ 30 x 2≥130
10 x 1−10 x 2 =30
x 1 , x 2 ≥0

z= X 1+ X 2+ 05 + 05 +0 5 −MA 1 −MA 2
1 2 3

10 X +30 X + 05 =120 2

30 X +30 X −05 + A 2=130 2

10 X +10 X = A
X 1 + X 2 −05 + A 2=30 3

j. Min Z = 12 x 1+ 8 x 2
 Subject to:
4 x 1+ 2 x 2 ≥24
2 x 1+ 2 x 2≥10
2 x 2≤8
x 1 , x 2 ≥0

Z=X 1 + X 2 + 05 + 05 + A + 05
1 2 3

4 X +2 X + 05 =24
2 1

2 X +2 X +0 5 + 05 =10
1 2

2 X + A=8
2

X 1 + X 2 +05 +05 +05 + A=0

1 2 2

8. Concept and history for further understanding:

a. Do a research on linear programming who introduced it? Where was it used?
Applications of the method of linear programming were first seriously attempted in the late
1930s by the Soviet mathematician Leonid Kantorovich and by the American economist
Wassily Leontief in the areas of manufacturing schedules and of economics, respectively, but
their work was ignored for decades.Linear programming can be applied to various fields of
study. It is widely used in mathematics, and to a lesser extent in business, economics, and for
some engineering problems. Industries that use linear programming models include
transportation, energy, telecommunications, and manufacturing.

b. Why do the maximum/minimum of linear programming occur at a vertex?

The maximum and minimum always values occur at the vertices because the vertex of a graph
indicates the turning point of the values. When the values increase then starts to decrease
from left to right at a certain point, that point is the highest value (maximum) of the graph.
c. What are the main elements of linear programming model ?

In Mathematics, the linear programming method is for optimizing the operations with some
constraints. The main point of linear programming is to minimize or maximize the numerical
value. It also has the linear functions that are subjected to the constraints in the form of linear
equations or in the form of linear inequalities.

Linear programming is considered an important technique which is used to find the optimum
resource utilization. The terminology “linear programming” has two words “linear” and
“programming”. The word “linear” says about the relationship between multiple variables with
degree one. The word “programming” says about the process of selecting the best solution
from different alternatives.

d. What are the special cases of LP solved by the simplex method? How do they differ
from each other?

The Simplex method is an approach to solving linear programming models by hand using slack
variables, tableaus, and pivot variables as a means to finding the optimal solution of an
optimization problem.  A linear program is a method of achieving the best outcome given a
maximum or minimum equation with linear constraints.  Most linear programs can be solved using
an online solver such as MatLab, but the Simplex method is a technique for solving linear
programs by hand.  To solve a linear programming model using the Simplex method the following
steps are necessary:
Standard form

↪️is the baseline format for all linear programs before solving for the optimal solution.

Slack variables

↪️are additional variables that are introduced into the linear constraints of a linear program to
transform them from inequality constraints to equality constraints

Simplex tableau 

↪️is used to perform row operations on the linear programming model as well as for checking
optimality.

Simplex method 

↪️is an approach to solving linear programming models by hand using slack variables, tableaus,
and pivot variables as a means to finding the optimal solution of an optimization problem.

Pivot variable 

↪️is used in row operations to identify which variable will become the unit value and is a key factor
in the conversion of the unit value.

Optimal solution

↪️of a maximization linear programming model are the values assigned to the variables in the
objective function to give the largest zeta value.  The optimal solution would exist on the corner
points of the graph of the entire model.

Non-basic variables 

↪️are variables that are zero in terms of the optimal solution.

Linear program

↪️is a model used to achieve the best outcome given a maximum or minimum equation with linear
constraints.
Inequality

↪️is an expression that does not have one definite solution and is distinguishable by its ‘greater
than’ or ‘less than’ symbols in the place of a traditional equal sign.

Constraints

↪️are a series of equalities and inequalities that are a set of criteria necessary to satisfy when
finding the optimal solution.

Basic variables

↪️are variables that are non-negative in terms of the optimal solution.