LINEAR EQUATION IN TWO VARIABLES

A Linear equation in two variables is in the form ax + by = c, where a, b and c are constants and a and b≠0. The
solution of linear equation in two variables is the set of points on a line that satisfies the given equation. This can be done
by assigning values for x and solving for the corresponding values of y or by finding the intercept.

Example 1. Solve 5x + 3y = 15

Solution: We solve the equation by intercept method.

Let x = 0 in 5x + 3y = 15 Therefore, x-intercept is at (3,0) and y-intercept is at

(0,5).
0 + 3y = 15
3y = 15
3 3
y=5

Let y = 0 5x + 0 = 15
5x = 15
5 5
x=3

Exercise 1

Graph the solution set of the following

equations: The points along the line comprise the solution set of the
equation.
1. x + y = 12
2. 6x + 5y = 40
3. 2x – 3y = 10

SYSTEM OF LINEAR EQUATIONS

A system of linear equations is two or more linear equations with the same variables. The solution of a system of
linear equations is the point of intersection of the lines representing the equations. This can be determined algebraically or
graphically. The algebraic solution may be done by elimination or substitution.

Example 1. Solve 2x + y = 4 equation 1

x – 2y = 7 equation 2

Solution:

a) Elimination Method
4x + 2y = 8
x – 2y = 7 The first equation is multiplied by 2, so that by adding the two equations,
5x + 0 = 15 the y term in both equation will be eliminated.
5x = 15
5 5
x = 3

Solve y by substituting x = 3 in one of the given equations.

2x + y = 4
2(3) + y = 4
6+y=4
y = 4-6
y = -2
The solution of equations 2x + y = 4 and x – 2y = 7, solved simultaneously, is the point (3, -2).

b) Substitution Method
Solve x in terms of y in one of the equations.
2x + y = 4
2x = 4-y
2 2
x = 4-y
2

Quantitative Techniques in Business learning Guide Page 1

 Then, substitute the value of x to equation 2 and solve for y.
x – 2y = 7
4-y - 2y = 7 2
2
4 – y – 4y = 14
-5y = 14-4
-5y = 10
-5 -5
y = -2

Finally, solve for x by substituting y = -2 in x= 4-y

2
x = 4 – (-2)
2
x=6
2
x=3

The solution of equations 2x + y = 4 and x – 2y = 7, solved simultaneously, is the point (3, -2).

c) Graphical Method
Find the x and y intercept of the two equations.
2x + y = 4 x-intercept (2,0)
y-intercept (0,4)

x – 2y = 7 x-intercept (7,0)
y-intercept (0,-3½)

Then, graph the lines in a single rectangular coordinate plane.

The intersection of the lines at (3, -2) is the solution of equation 2x + y = 4 and x – 2y = 7.

Exercise 2

A. Solve the following set of linear equations using elimination and substitution
method:
1. x + y = 4 and x – y = 2
2. 3x + y = 10 and x – 2y = 8
3. 5x + 4y = 9 and 9y – 2y = 7

B. Solve the following set of linear equations by graphical method:

1. 4x + 3y = -12 and x – y = 6
2. 4x – 2y =8 and x + 2y = 10

Quantitative Techniques in Business learning Guide Page 2

LINEAR INEQUALITIES IN ONE VARIABLE
An inequality is a system formed by placing an inequality symbol between numeral and variable expression. An
inequality containing a variable is called an open sentence inequality. The solution set of such inequality is the set of all
values of the variables that make the inequality a true statement

Example 1: Solve and graph 7x – 8 < 4x + 7

Solution: 7x – 8 < 4x + 7
7x – 4x < 7 + 8
3x <15
3 3
x< 5

Graph:

The solution includes all the points on the number lines less than 5, but not including 5. The hollow point shows
that 5 is not part of the solution.

Example 2: Solve and graph y-3 - 1 ≥ y

4 2
Solution: y-3 - 1 ≥ y
4 2
y-3 - 1 ≥ y
4 4
4 2
y – 3 – 4 ≥ 2y
-y ≥ 7
-1 -1
y≤7

Graph:

The solution includes all the points more than 7 including 7 since the inequality symbol is less than or equal to (≤).

Exercises 3

Solve each of the following inequalities and

graph the solution set.
1. 3 – x < 4 (x – 3)
2. 3 – x ≥ 5 (3-x)
3. 3x + 2 ≥ 2x - 5

LINEAR INEQUALITIES IN TWO VARIABLES

An inequality that can be written as Ax + By < C, Ax + By ≤ C and Ax + By ≥ C, where A, B and C are real
numbers and A and B are not both zero, are called linear inequalities in two variables.
The solution set of a linear inequality in two variables is the subset of the plane consisting all points (x,y) whose
coordinates satisfy the inequality:
To find the solution set of linear inequality:
1) Replace the inequality set of a linear inequality.
2) Graph the corresponding line. If the symbol of the inequality is < or >, use a dashed line indicate that the
line is not part of the solution set.
3) Choose any point that does not lie on the line, if possible (0,0), and substitute its coordinate to the given
inequality. If the point satisfies the inequality, all the points on the same half-plane is the solution set of the
inequality. Otherwise, the solution is the half-plane not containing the set point.

Example 1: Solve 3x + 2y ≤ 6
Solution: 3x + 2y ≤ 6
3x + 2y = 6

Quantitative Techniques in Business learning Guide Page 3

Graph the equation by finding the intercepts:
x-intercept, (2,0)
y-intercept, (0,3)
Graph:

Using the origin as a testing point,

3x + 2y ≤ 6
3 (0) + 2 (0) ≤ 6
0 ≤ 6 TRUE

We get a true statement, therefore, the

solution set is the half-plane contains the origin.

Example 2: Solve ½x + y > 4

Solution: ½x + y > 4 2
x + 2y = 8
Intercepts: (8,0) and (0,4)

Substituting (0,0) to the inequality,

½x + y > 4
½(0) + (0) > 4
0 > 4 FALSE

We get false statement, so the solution set is the

half- plane not containing (0,0).

Quantitative Techniques in Business learning Guide Page 4

 Exercises 4

Find the solution set of the given inequalities:

1. x – 2y ≤ 6
2. x – y < 12
3. x + 2y ≥ 4

THE SIMPLEX MAXIMIZATION METHOD OF LINEAR PROGRAMMING

The simplex method of linear programming was developed by George B. Dantzig of Stanford University. It is a
repetitive optimizing technique. It repeats the process of mathematically moving from an extreme point to another point
until an optimal solution is reached.

A. Simplex Maximization Problems

The method of solving a maximization problem is different from minimization in the simplex method.

Steps in solving a Maximization Problem

1) Set up the constraints from the conditions of the problem.
2) Convert the inequality explicit constraints to equations by adding slack variables.
3) Enter the numerical coefficients and variables in the simplex table.
4) Calculate the Cj and Zj values.
5) Determine the optimum column or entering variable by choosing the most positive value in the Cj – Zj
row.
6) Divide the quantity-column values by the non-zero and non-negative entries in the optimum column. The
smallest quotient belongs to the pivotal row.
7) Compute the values for the replacing row by dividing all entries by the pivot. Enter the result in the next
table .
8) Compute the new entries for the remaining rows by reducing the optimum column entries to zero (entries
in the constraint rows)
9) Calculate Cj and Zj values. Compute also for Cj – Zj row.
10) If there is a positive entry in the Cj – Zj row, return to step 5. The final solution has been obtained if there
is no positive value in the Cj – Zj row.

Example 1:
The Margan Furniture makes two products: tables and chairs, which must be processed through assembly and
finishing departments. Assembly department is available for 60 hours in every production period, while the finishing
department is available for 48 hours of work. Manufacturing one tables requires 4 hours in the assembly and 2 hours in
the finishing. Each chair requires 2 hours in the assembly and 4 hours in the finishing. One table contributes Php80.00 to
profit, while a chair contributes Php 60.00. the problem is to determine the number of tables and chairs to make per
production period in order to maximize profit.

Solution:
time in assembly Ti m e i n f i ni s hi n g profit
Let x = number of table s 4 x 2 x 8 0 x
Let y = number of chair s 2 y 4 y 6 0 y

Formulating the objective function and constraints:

Maximize: Z = 80x + 60y

Subject to: 4x + 2y ≤ 60
2x + 4y ≤ 48 explicit constraints
x ≥ 0, y ≥ 0 - implicit constraints

We used Z to represent the quantity we want to maximize.

Before we convert the explicit constraints to equations, you may have the option of removing first the greatest
common factor in each inequality whenever possible, to simplify the coefficients. So, dividing each inequality by 2, (the
common factor) we have the program:

Maximize: Z = 80x + 60y

Subject to : 4x + y ≤ 30
x + 2y ≤ 24
x ≥ 0, y ≥ 0

Quantitative Techniques in Business learning Guide Page 5

Converting the Constraints to Equations
To convert the inequalities to equalities to equations, since in our problem, the left members are less than the right
members, they can be equal if we add some quantities to the left. Let these quantities be called slack variables. The slack
variables fill the gap between the left and the right members of the inequalities. It can also be said that a slack variable
represents the unused quantities in the constraints. This can be seen in checking the objectives after the solutions are
found.

Let Snrepresent the slack variables.

The new program with slack variables will be:
Maximize: Z = 80x + 60y + 0S1 + 0S2
Subject to: 2x + y + S1 = 30
x + 2y + S2= 24
x ≥ 0, y ≥ 0
S1 ≥ 0, S2 ≥ 0

Setting Up the Initial Table

Initial Table
Contribution to profit column Constant column
Variable column

C j 8 0 6 0 0 0 Objective coefficient row

Prod Qty x y S 1 S2 Variable row
0 S 1 3 0 2 1 1 0
Constraint coefficient
0 S 2 2 4 1 2 0 1
Z j 0 0 0 0 0
Cj - Zj 8 0 6 0 0 0

The initial table contains the coefficients of the objective in the Cj row. Note that the slack variables do not
contribute any profit, hence they have zero coefficients in the objective. The second row is composed of the
product, quantity (or constant) column and solution variables.

The initial table should begin with zero contributions to profit, entered in the Cj column. Since the
corresponding variables (with zero profit contribution) are S 1 andS2, then these variables should be the ones
entered in the product column.

We must add two more rows in the table, t5he Zj and Cj – Zj row is obtained by multiplying the profit
contribution in Cj column by each of the coefficients in the constraints, then add their products. Hence:

0 (30 2 1 1 0) = 0 0000
0 (24 1 2 0 1) = 0 0000
Zj = 0 0000

To computer for Cj – Zj row, subtract the entries in Zj row from Cj row entries.

80 60 0 0
- (0 0 0 0)
80 60 0 0

The column containing the greatest positive entry in the Cj - Zj is the optimum column. In our table, 80 is
the greatest positive, hence we encircle the column. If we devide 30 and 24 by 2 and 1 respectively, 30÷2 has a
smaller quotient, hence the first constraints row is the pivotal row.

Initial Table with the indicated optimum column and pivotal row.
Entering variable

C j 8 0 6 0 0 0
Prod Qty x y S 1 S2
0 S 1 3 0 2 1 1 0 Pivotal row
Outgoing
variable 0 S 2 2 4 1 2 0 1
Z j 0 0 0 0 0
Cj - Zj 8 0 6 0 0 0

Optimum column

Quantitative Techniques in Business learning Guide Page 6

 The variable found at the top of the optimum column should be the entering or incoming variable and the variable
to the left of the pivotal rtow is the outgoing variable. The entry encircled twice is called the pivot.

The Second Table

The pivotal row entries should be divided by 2, the pivot, in order to change the pivot to 1. (30 2 1 1 0) ÷ 2 = 15
1 ½ ½ 0. The result is called the replacing row and should be the row to be entered first in the second table.

Table II (with the replacing row)

C j 8 0 6 0 0 0
Prod Qty x y S 1 S2
8 0 x 1 5 1 ½ ½ 0 Replacing row
0 S 2
Z j
Cj - Zj

The second constraint row or S2 row is the row to be replaced. Since the numeral found below the pivot is 1 (in the
old row) we must multiply the replacing row by -1, (additive inverse of 1) and add the result to the row top be replaced in
order that the entry below the pivot becomes zero. Hence:

Computing S2 row
Replacing row
Row to be replaced
15(-1) + 24 = 9
1(-1) + 1 = 0
½(-1) + 2 = 1½ or 3/2
½(-1) + 0 = -½
0(-1) + 1 = 1

Table II (with new entries in the S2 row)

C j 8 0 6 0 00
Prod Qty x y S 1 S2
8 0 x 1 5 1 ½ ½ 0
3
0 S 2 9 0 / 2 - ½ 1
Z j
Cj - Zj

Table II(with entries in the Zj row)

To compute for Zj row multiply 80 by (15 1 ½ ½ 0) and

C j 8 0 60 0 0 multiply 0 by (9 0 3/2 -½ 1) then add the results. Hence,
Prod Qty x y S 1 S2
8 0 x 1 5 1 ½ ½ 0 80(15 1 ½ ½ 0) = 1200 80 40 40 0
0 S 2 9 0 3
/ 2 - ½ 1 0(9 0 3/2 -½ 1) = 0 0 0 0 0
Z j 1200 8 0 4 0 4 0 0 1200 80 40 40 0
Cj - Zj

Table II(with complete entries of elements)

To compute for Cj – Zj row, we subtract 80 40 40 0 form

C j 8 0 60 0 0 80 60 0 0, hence
Prod Qty x y S 1 S2
8 0 x 1 5 1 ½ ½ 0 80 40 40 0
3
0 S 2 9 0 / 2 - ½ 1 - ( 80 60 0 0 )
Z j 1200 8 0 4 0 4 0 0 0 20 -40 0
Cj - Zj 0 2 0 -40 0

Quantitative Techniques in Business learning Guide Page 7

Developing the Third Table
Again we select the most positive entry in the Cj – Zj row. We encircle the column containing this entry. In the
table II, 20 is the ,most positive in Cj – Zj row, hence it belongs to the optimum column.

Table II

C j 8 0 6 0 0 0
P r o d Qty x y S 1 S2
8 0 x 1 5 1 ½ ½ 0
3
0 S 2 9 0 / 2 - ½ 1 Pivotal row
Z j 1200 8 0 4 0 4 0 0
Cj - Zj 0 2 0 -40 0

Optimum column

Divide 15 by ½ and 9 by 3/2 to locate the pivotal row. Since the lower quotient is 9 ÷ 3/2 = 6 so, the second
constraint row is the pivotal row and 3/2 is the pivot.

Again the variable above the optimum column is the entering variable and the variable to the left of the pivotal row
is the outgoing variable. We now reduce the pivot to 1 by dividing the pivotal row by 3/2 . (9 0 3/2 -½ 1) ÷ 3/2
= 6 0 1 -1/3 2/3

Table III (with the replacing row)

C j 8 0 6 0 0 0
Prod Qty x y S 1 S2
8 0 x
6 0 y 6 0 1 -1/3 2
/3 Replacing row
Z j
Cj - Zj

Table III (with new entries in the first constraint row or x-row)

The row to be replaced is the x-row. The entry

C j 8 0 6 0 0 0 to be reduced to zero is ½, (in the old row).
Prod Qty x y S 1 S2
2
Solving for the new entries in the x-row:
8 0 x 1 2 1 0 / 3 -1 /3
6 0 y 6 0 1 -1/3 2
/3 6(-½) + 15 = 12 2
/3(-½) + 0 = -1/3
Z j 0(-½) + 1 = 1
Cj - Zj 1(-½) + ½ = 0
-1/3(-1/2) + ½ = 4/6 or 2/3

Table III (with complete entries)

Again to compute for Zj row:
C j 8 0 6 0 0 0 80(12 1 0 2/3 -1/3) = 980 80 0 /3 -80/3 160
Prod Qty x y S 1 S2 60( 6 0 1 -1/3 2/3) = 360 0 60 -60/3 120/3
2
8 0 x 1 2 1 0 / 3 -1 /3 1320 80 60 100/3 40/3
1 2
6 0 y 6 0 1 - /3 /3 Compute for Cj – Xj row:
100 40
Z j 1320 8 0 6 0 /3 /3 80 60 0 0
100 40
Cj - Zj 0 0 - / 3 - /3 - ( 80 60 100/3 40/3 )
0 0 -100/3 -40/3
Finding the Optimum Solution:
Since the last row has no more positive entry, then Table III is the optimum.
Decision:
x = 12
y=6
Maximum (Z) = 1320

Quantitative Techniques in Business learning Guide Page 8

Summary of the Simplex Table

Table I

C j 8 0 6 0 0 0
Prod Qty x y S 1 S2
0 S 1 3 0 2 1 1 0 Pivot row
0 S 2 2 4 1 2 0 1
Z j 0 0 0 0 0
Cj - Zj 8 0 6 0 0 0

Optimum column
Table II

C j 8 0 6
0 0 0
Prod Qty x y S 1 S2
8 0 x 1 5 1 ½ ½ 0 Replacing row
3
0 S 2 9 0 / 2 - ½ 1 Pivot row
Z j 1200 8 0 4 0 4 0 0
Cj - Zj 0 2 0 -40 0

Optimum column
Table III

C j 8 0 6 0 0 0
Prod Qty x y S 1 S2
2
8 0 x 1 2 1 0 / 3 -1 /3
6 0 y 6 0 1 -1/3 2
/3 Replacing row
100
Z j 1320 8 0 6 0 / 3 40/3
Cj - Zj 0 0 - 1 0 0 / 3 - 40/3

Exercises5
Solve by the simplex method by filling up the subsequent tables:

Maximize: 100x + 80y

Subject to: 4x + 2y ≤ 100
2x + 4y ≤ 140
x ≥ 0, y≥0
New Program with Slack Variables:
Maximize: _______________
Subject to: _______________

Table I 100 80 0 0
Cj Prod Qty x y S1 S2
Decision:
0 S1
0 S2
x = _______
Table II Zj
y = _______
Cj-Zj
Z = _______
100 x
0 S2
Table III Zj
Cj-Zj
100 x
80 y
Zj
Cj-Zj

Quantitative Techniques in Business learning Guide Page 9