College of Information Technology, Computing and Library Science

C– GEC 4: Teaching Mathematics in the Modern World

First Semester | AY 2020-2021

Modules 8 & 9 (Weeks 8 & 9) in C – GEC 4:

MATHEMATICS IN THE MODERN WORLD

First Semester AY 2020-2021

LINEAR PROGRAMMING

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 1|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

A. Course Code /Title : C-GEC4– MATHEMATICS IN THE MODERN WORLD

B. Module Number : 7&8 - Linear Programming
C. Time Frame : six (6) hours
D. Materials : Syllabus, online module, references, online resources

I. Overview
This module discusses how to do things efficiently. An efficient method allows one, for
example, to divide limited resources optimally. It provides explanation of the basic concepts of
Linear Programming (LP) as one of the simplest and a widely used problem-solving method to
perform optimization. The LP model is introduced to help solve some very complex optimization
problems by making a few simplifying assumptions and to determine the optimal value of a
linear function which defines the objectives of the problem subject to a set of linear constraints.
The constraints are defined as the limit or decision environment of the problem. In LP problems,
the term optimal may mean maximizing profit or minimizing cost in a specific context.

A linear program can be solved by multiple methods. In this module , we are going to look at
the Graphical method for solving a linear programming in finding the optimal solution.

II. Desired Learning Outcomes

At the end of this module, the learner should be able to:

(1) define linear programming and explain its use;

(2) set up simple decision problems as linear programming models;
(3) solve maximization and minimization linear programming problems using the graphical
method; and
(4) recognize the importance of Linear Programming Model in making decisions, in
business, economics, and in management science.

III. Content / Discussion

Lesson 2.1- THE LINEAR PROGRAMMING

MODEL
Introduction

⮚ Applications of linear programming are everywhere around us. From using your time
productively to solving supply chain problems for a company – everything uses optimization. 
When you are driving from home to work and want to take the shortest route or when you
have a project delivery you make strategies to make your team work efficiently for on-time
delivery, you are using then linear programming.

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 2|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

⮚ A good manager can maximize the company’s profit and minimize its cost without violating any
limitation or restriction on existing variables, such as time and quantity of available raw
materials. Linear programming is a vital tool in management science. This quantitative
techniques in management is so important that it results in enormous savings of money.

⮚ Many problems in business, economics, and the sciences require that a function should be
maximized or minimized subject to a set of constraints. If the function to be maximized or
minimized is linear and the constraints are linear equations or inequalities , the problem is
called linear programming.

What is linear programming ?

⮚ Linear programming is a mathematical procedure of determining linear allocation of business

variables. It refers to several related mathematical techniques to allocate resources among
competing demands in an optimal way or solution to problems having thousands of variables
and constraints.

Common terminologies used in Linear Programming

● Decision Variables - are the output variables or activities that represent the ultimate
solution. In solving any problem, the decision variables must be identified first . They are
usually denoted by x & y. The unit of measurement of these decision variables must be
carefully considered.

● Objective Function - is defined as the objective of making decisions. It is an algebraic

expressions introduced by the word maximize or minimize. It is expressed in terms of
decision variables or activities. For example, a decision maker may wish to maximize profit
or minimize cost on his or bear manufacturing business.

● Constraints or Limitations - are the restrictions or limitations on the decision variables.

They usually limit the value of the decision variables.They can be scarce resources, men,
machine, money, or time. They can also be specifications contractual limitations as policy
restrictions. They are algebraic sentences introduced by “subject to” expressed in terms of
linear equations or inequalities .

● Optimum Solution - is a solution that makes the objective function as large as possible in the
case of maximization process, and as small as possible in the case of minimization
process. It always lies at the extreme point of the bounded region or at the intersection
of two or more constraints.

● Feasible Solution - is the set of all points located in the feasible region in the graph satisfying
the constraint. It is one which doesn’t violate any constraint.

NOTE : If a linear programming problem has an optimal solution, then there is always at
least
one extreme point (corner point) solution of the feasible region. A linear programming
problem with bound, non-empty feasible regions always contains optimal solutions.

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 3|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

Essential factors for constructing Linear programming:

1.The objective function to be either maximized or minimized must a linear function.

2.The constraints restricting the activities in the program should also be linear.
3. All decision variables should always take non-negative values. This means that the values
for decision variables should have a value greater than or equal to zero. Say x, y ≥ 0
4.The relationship of variables could expressed in terms of linear equations or inequalities .

Fundamental Theorem of Linear programming

⮚ In linear programming problem, the optimum value of the objectives function if it
exists, occurs at a vertex of the feasibility region.

⮚ The formulation of a linear programming model is similar to translating a worded problem in

many areas of mathematics that use mathematical symbols. Just like Polya’s problem solving
strategy, one must read and understand the problem carefully until a complete understanding
of what it is all about is achieved.

The Linear Programming Algorithm : Steps in defining a Linear Programming Model:

1. Identify the decision variables : represent them as x & y.
2. Know the objective to optimize either by minimization or maximization .
3. Identify the coefficients of the decision variables in the objective function . These
coefficients give the per unit contribution of the decision variables in the objective
function.
4. Write the objective function of decision maker to be optimized in terms of the decision
variables, x & y.
5. Know the resources controlled by or for the decision maker (resource capacity).
6. Identify the technical coefficients that give a link between the decision variables and the
resources . The technical coefficients define how much it takes for each resource to
produce a unit of a decision variable. The unit of measurement is also needed.
7. Formulate a set of linear inequalities subject to the constraints.
8. Explicitly state the non-negativity restriction : x, y ≥ 0

Note : Constructing a table will help us understood and analyze more any given LP problem .

⮚ Setting up linear programming models was been discussed already. The question now is how
to get the values of the decision variables and the objective function. According to Kaiser and
Messer (2014), there are three ways to solve LP models.

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 4|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

a. Graphical Method - is best used only for simple LP models involving two or three decision
variables.
b. Simplex Method is an efficient algebraic solution for LP models involving several decision
variables.
c. LP computer software is actually programmed based on the iterations of the simplex
method to solve very large LP problems.
Solution of Linear Programming Models by Graphical Method in two variables:
1. Graph each linear equation and inequality subject to the constraints following the
2. steps discussed in Module 7.
3. Find the feasibility region for the constraints and identify its vertices.
4. Evaluate the objective function at each vertex on the decision table and;
5. The solution occurs at the vertex that yields the optimum value of the objective
function.
6. Interpret the result.

Illustrative example on how to solve linear programming model by Graphical Method:

EXAMPLES : Find the Mx and Mn values of the following given objective function subject to given
constraints.
#1: Objective : P = 2x + 10y : Maximize Profit
Constraints : Subject to :
2x +y≤6
5 x + 4y ≤ 20
x ≥0
y≥0
STEP 1 : Set up the table for the constraints.

2x+y≤6 5 x + 4y ≤ 20 x ≥0 y≥0
2x +y=6 5 x + 4y = 20 x =0 y=0
x =0 x=3 x=0 x=4 TP (1, 1) TP (1, 1)
y=6 y=0 y=5 y=0 0 ≤ 1 : TRUE 0 ≤ 1 : TRUE
(0, 6) (3, 0) (0, 5) (4, 0)
TP (0, 0) TP (0, 0)
0 ≤ 6 : TRUE 0 ≤ 20 : TRUE

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 5|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

STEP 2 : Graph the constraints and find the Feasible region FR and its vertices.

STEP 3 : Set up the Decision Table:

Extreme Points 2x + 10y Profit

STEP 4 : Decision Rule :

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 6|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

#2: Objective : P = 4x + 12y

Subject to :
-x+y≤ 1
2x + 3y ≥ 12
x≤4
y≤4

STEP 1 : Set up the table for the constraints.

-x+y≤ 1 2x + 3y ≥ 12 x≤4 y≤4

-x+y= 1 2x + 3y ≥ 12 x=4 y= 4
x=0 x = -1 x=0 x = 6
TP (0, 0) TP (0, 0)
y=1 y=0 y=4 y=0
0 ≤ 4 : TRUE 0 ≤ 4 : TRUE
(0, 1) (-1, 0) (0, 4) (0, 6)
TP (0, 0) TP (0, 0)
0 ≤ 1 : TRUE 0 ≥ 20 : FALSE

STEP 2 : Graph the constraints and find the Feasible region FR and its vertices.

STEP 3 : Set up the Decision Table:

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 7|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

Extreme Points 4x + 12y Profit

STEP 4 : Decision Rule :

#3: Objective : P = 3x + 20y +5

Subject to :
4x + 3y ≥ 12
7x + 6y ≤ 42
y≤5
y≥2
x≥0
STEP 1 : Set up the table for the constraints.

STEP 2 : Graph the constraints and find the Feasible region FR and its vertices.

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 8|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

STEP 3 : Set up the Decision Table:

Extreme Points 3x + 20y +5 Profit

STEP 4 : Decision Rule :

APPLICATION OF LINEAR PROGRAMMING

The steps in formulating linear programming problems are illustrated by the following
example:

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 9|Page

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

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
hrs in every production period, while the Finishing Department is available for 48 hrs.
Manufacturing one table requires 4 hrs. in the Assembly Department and 2 hrs. in the Finishing
Department. Each chair requires 2 hrs. in the Assembly Dept. And 4 hrs. in Finishing Dept. A table
contributes PhP180.00 to profit and PhP100.00 for each chair. The problem is to determine the
number of tables and chairs to produce in order to maximize the profit.
STEP 1 : Represent the decision variables.
Let x - be the number of tables to produce in order to maximize the profit.
y - be the number of chairs to produce in order to maximize the profit.
STEP 2 : Set up a table to identify the coefficients of the decision variables in the objective function
and constraints

Production Period, hrs

Decision variables Assembly Finishing Profit
Departmen Department
t
Table, x 4x 2x 180 x
Chair, y 2y 4y 100 y
TOTAL ≤ 60 ≤ 48

STEP 3 : Formulate the objective function and constraints

Objective : P = 180 x + 100 y : Maximize the profit.

Subject to :
4 x + 2 y ≤ 60
2 x + 4 y ≤ 48
x ≥ 0
y ≥ 0

STEP 4 : Set up the table for the constraints.

4 x + 2 y ≤ 60 2 x + 4 y ≤ 48 x ≥ 0 y ≥ 0
4 x + 2 y = 60 2 x + 4 y ≥ 48 x = 0 y = 0
x=0 x = 15 x=0 x = 24 TP (1, 1) TP (1, 1)
y = 30 y=0 y = 12 y=0 0 ≤ 1 : TRUE 0 ≤ 1 : TRUE
(0, 30) (15, 0) (0, 12) (24, 0)
TP (0, 0) TP (0, 0)
0 ≤ 60 : TRUE 0 ≤ 48 : TRUE
STEP 5 : Graph constraints and find the Feasible region FR and its vertices.

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 10 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

STEP 6 : Set up the Decision Table:

Extreme Points 180 x + 100 y Profit

STEP 7: Decision Rule :

Example 2: A small generator burns two types of fuel: Low Sulfur and High Sulfur. One gallon of
Low Sulfur emits 3 units of Sulfur Dioxide, generates 4 kw of electricity and cost PhP160.00. One
gallon of High Sulfur emits 5 units of Sulfur Dioxide, generates 4 kw of electricity and cost
PhP150.00. The environmental protection program insists that the maximum amount of Sulfur
Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 11 | P a g e
 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

Dioxide that can be emitted per hour is 15 units only. Suppose that at least 16 kw of electricity
must be generated per hour, How many gallons of each kind of fuel must be utilized to minimize
the cost of fuel?

STEP 1 : Represent the decision variables.

Let x - be the number of gallons of Low Sulfur to be utilized to minimize the cost of fuel
y - be the number of gallons of High Sulfur to be utilized to minimize the cost of fuel
STEP 2 : Set up a table to identify the coefficients of the decision variables in the objective function
and constraints

Sulfur Dioxide Power

Decision variable
Emission Generation COST
Low Sulfur , x 3x 4x 160 x
High Sulfur , y 5y 4y 150 y
TOTAL ≤ 15 ≥ 16

STEP 3 : Formulate the objective function and constraints

Objective : C = 160 x + 150 y : Minimize the cost.

Subject to :
3 x + 5 y ≤ 15
4 x + 4 y ≥ 16
x ≥ 0
y ≥ 0

STEP 4 : Set up the table for the constraints.

3x+5y ≤ 15 4 x + 4 y ≥ 16 x ≥ 0 y ≥ 0
3x+5y ≤ 15 4 x + 4 y ≥ 16 x = 0 y = 0
x=0 x=3 x=0 x=4 TP (1, 1) TP (1, 1)
y=3 y=0 y=4 y=0 0 ≤ 1 : TRUE 0 ≤ 1 : TRUE
(0, 3) (15, 0) (0, 4) (4, 0)
TP (0, 0) TP (0, 0)
0 ≤ 15 : TRUE 0 ≥ 16 : FALSE

STEP 5 : Graph constraints and find the Feasible region FR and its vertices.

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 12 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

STEP 6 : Set up the Decision Table:

Extreme Points 160 x + 150 y Cost

STEP 7: Decision Rule :

Example 3: RFC Company manufactures two types of Lamps: Special Lamp and Regular Lamp. Each
special lamp requires 4 pounds of brass and each regular lamp requires 8 pounds of brass. During
each production period, the company’s brass supply is limited to 640 pounds. Each special lamp
requires 6 hours of milling time in the machines and each regular lamp requires 2 hrs. of milling
Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 13 | P a g e
 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

time in the machines. The company’s machines are available only for 360 hrs. in each production
period. Each special lamp requires 5 light bulbs that must be imported from Hongkong. The
importation of these bulbs is limited to 200 units. The contribution to profit of each special lamp
isPhp400.00 and Php360.00 on the regular lamp. How many units of the special lamp and regular
lamp should be produced per production period in order to maximize the profit?
STEP 1 : Represent the decision variables.
Let x - be the number of units of special lamps to produce to maximize the profit
y - be the number of units of regular lamp to produce to maximize the profit
STEP 2 : Set up a table to identify the coefficients of the decision variables in the objective function
and constraints

Pounds of Brass Milling Time, hr

Decision variable
Required Light Bulbs PROFIT
Special lamp , x 4x 6x 5x 400 x
Regular lamp , y 8y 2y 360 y
TOTAL ≤ 640 ≤ 360 ≤ 200

STEP 3 : Formulate the objective function and constraints

Objective : C = 400 x + 360 y : Maximize the profit.

Subject to :
4 x + 8 y ≤ 640
6 x + 2 y ≤ 360
5x ≤ 200
x ≥ 0
y ≥ 0

STEP 4 : Set up the table for the constraints.

4x+8y ≤ 640 6 x + 2 y ≤ 360 5x ≤ 200 x ≥ 0 y ≥ 0

4x+8y = 640 6 x + 2 y = 360 5x = 200 x = 0 y = 0
x=0 x = 160 x=0 x = 60 TP (1, 1) TP (1, 1)
y = 80 y=0 y = 180 y=0 x = 40 0 ≤ 1 : TRUE 0 ≤ 1 : TRUE
(0, 80) (160, 0) (0, 180) (60, 0)
TP (0, 0) TP (0, 0) TP (0, 0)
0 ≤ 15 : TRUE 0 ≤ 16 : TRUE 0 ≤ 200 :
TRUE

STEP 5 : Graph constraints and find the Feasible region FR and its vertices.

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 14 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

STEP 6 : Set up the Decision Table:

Extreme Points C = 400 x + 360 y Cost

STEP 7: Decision Rule :

I CAN DO
Example #4 : A farmer has 40 hectares of farm on which to plant rice and corn. The rice needs 4
units

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 15 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

of insecticide and two units of fertilizer per hectare, while corn requires 3 units of
insecticide and 6 units of fertilizer. He has at least 90 units of insecticide and at least 120
units of fertilizer available. His average profit per hectare on rice is Php15,000.00 and
Php10,00.00 on corn. How many hectares of each crop should he plant to maximize his
average profit.

Activity# 1 : Now that you had gone through The Linear Programming - Graphical solution,
you are now ready to do the following. Submit the output following this format.
Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 16 | P a g e
 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

Name _____________________________________________ Date____________________

Course& Yr.& Section:______________________________ SCORE: ________________
Activity #1 : Solution of Linear Programming Problems by Graphical Method
1. Objective : Minimize cost
C = 60x + 9y
Subject to :
4x + 5y ≤ 40 x≥0
2x + 5y ≤ 30 y≥0
6x + 3y ≥ 30

2. Gay Minette assembles stereo equipment for sale in her shop. She offers two product turntables
and cassette players. She makes a profit of 300 on each turntable and 350 on each cassette. Both

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 17 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

must go through two steps in her shop assembly and bench-check. A turntable takes 12 hrs to
assemble and 4 hrs to bench-check. A cassette player take 4 hrs to assemble but 8 hrs. to bench-
check. Gay has 60 hrs. Available in assembly per period of production and 40 hrs. of bench-
checking time. How many cassette players and turntables should be made per production period
for maximum profit?

Let x -
y-

OBJECTIVE :

Subject to :

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 18 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

3. A poultry raises wants to mix two types of Grain. A and B. Each unit of grain A costs 40 and contains
20 grams of fat, 10 grams of protein and 800 calories. Each unit of grain B costs 48 and contains 30
grams of fat, 30 grams of protein and 600 calories. Suppose that the poultry raiser wants each unit of

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 19 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

the final product to yield at least 180 grams of fat at least 120 grams of protein and at least 4800
calories. How many units of each type of grain should the poultry raiser use to minimize his cost?

Let x -
y-

OBJECTIVE :

Subject to :

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 20 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

IV. EVALUATION

NAME : ______________________________________________________ SCORE : _____________________

PROGRAM/YEAR LEVEL ___________________________________ DATE : ______________________

QUIZ - Solution of Linear Programming Problems by Graphical Method

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 21 | P a g e
 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

SOLVE THE FOLLOWING .

1. Objective : Maximize profit
P = 50x + 70y
Subject to :
4x + 3y ≤ 1500 x≥0
4x + 2y ≤ 1200 y≥0
9x + y ≥ 1200

2. A diabetic patient needs at least 40 units of Vitamin A, at least 30 units of Vitamin C, at least 30 units
of Vitamin E each day. Each brand X multivitamin capsule contains 4 units of Vit.A, 6 units of
Vit.C, and 2 units of Vit.E. Each brand Y multivitamin capsule contains 5 units of Vit.A, 3 units
of Vit.C, and 5 units of Vit.E. If each brand X multivitamin capsule cost PhP6.00 and each brand Y
multivitamin capsule cost PhP9.00 , how many capsules should the patient take each day to
minimize the cost.
Let x -
y-
Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 22 | P a g e
 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

OBJECTIVE :

Subject to :

DECISION RULE :

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 23 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

3. A Chemist produces two types of fertilizers : A and B . The profits realized from a kilo of type A is
PhP50.00, and from a kilo of type B is PhP75.00. The raw materials from which the
fertilizer A is made are 4 kilos of nitrogen, 4 kilos of sulfur, and 9 kilos of potassium. While the
fertilizer B is made are 3 kilos of nitrogen, 2 kilos of sulfur, and 1 kilo of potassium. The
available
stocks include 1,500 kilos of nitrogen, 1,200 kilos of sulfur, and at least 1,200 kilos of potassium.
Find the amounts of fertilizer A and fertilizer B to be produced in order to maximize the profit.

Let x -
y-

OBJECTIVE :

Subject to :

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 24 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

DECISION RULE :

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 25 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

V. References
Alejan, Ronnie O. et.al. (2018). Mathematics in the Modern World. Mutya Publishing House, Inc.
Potrero, Malabon City Philippines

Baltazar, et.al. (2018). Mathematics in the Modern World. C & E Publishing Inc. 839, EDSA South
Triangle, Quezon City

Nocon, Rizaldi C., et.al. (2016). Essential Mathematics for the Modern World. C & E Publishing,Inc.
South Triangle, Quezon City Philippines

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 26 | P a g e

 College of Information Technology, Computing and Library Science
C– GEC 4: Teaching Mathematics in the Modern World
First Semester | AY 2020-2021

Carpio, J. & Peralta B. (2018). Mathematics in the Modern World. Books Atbp. Publishing Corp.
Barangka Drive, Mandaluyong City

https://www.analyticsvidhya.com/blog/2017/02/lintroductory-guide-on-linear-programming-
explained-in-simple-english/

Congratulations for having completed this C-GEC4 Modules 8 & 9!

Meet you in the next Module

Faculty: Grace D. Tiqui Prepared by: Carina S. Dizon 27 | P a g e