I and the World

Math 101- Mathematics in the Modern World

Paterno S. Baguinat III

I and the World

Copyright 2020
All rights reserved.

No part of this module shall be copied, printed, or stored in any retrieval system without
prior permission from the owner.

ISBN -0212-CNX

Page and cover designed by Your Positive Oasis

First Edition

JRMSU – Main Campus

Dapitan City, Philippines
 Preface

  Titled “I and the World”, this module aims to help students in demonstrating
knowledge, skills and attitude in the course Mathematics in the Modern World.

Sad, sweet memories baffled the writer in making this module.

This module is composed of seven units.

 Acknowledgment

This course module would not be a reality without the help of the following
individuals:

My family for always being there for me.

 Table of Contents

Title Page i

Copyright Page ii

Preface iii

Acknowledgment iv

Module 1. Linear Programming

Unit 1: Optimizing Linear Programs by Graphical Solution 1

Unit 2: Optimizing Linear Programs by Algebraic Manipulation 2

Unit 3: Optimizing Linear Programs by Tableau Method 13

References 59

Rubrics 60

Index 67

Appendices 71

Glossary 73

Answer Key 80
 Unit 1

Introduction to Linear Programming

In the advent of real-world complex situations, decision makers opt to rely more upon the
concept of mathematics, specifically Linear Programming (LP) and its significance in solving
complex problems such as handling cases, product mix, process-and-cost management in
business entities as well as educational institutions, among others.

LP emerged as one among the extremely powerful tools that can be used effectively to
solve optimization problems having two or more variables or even thousands of variables under
consideration.

This chapter begins with solving linear programming problems using graphical method.
In this method, critical points are determined from feasible regions, and were evaluated
depending whether or not they satisfy the maximization or minimization objective function.
Elimination and substitution methods of solving linear systems involving two variables are also
included. However, given that real life problems involve more than two variables, graphical
method would not be enough; thus, simplex algorithm was discussed and illustrated
subsequently.

Along with the advances in computing, development in simplex algorithms for solving
programming problems flourish. Simplex algorithm was introduced in 1947 by George Dantzig,
American mathematical scientist. This approach promptly assumes a major role in the solution
of linear problems, through a mathematical model consequently obtaining a solution through a
programmable process called an algorithm, reflecting a range of managerial options, in
management problems for example.

Learning Outcomes

At the end of this unit, you will be able to:

 Solve optimization problems involving linear programming by graphical method

 Create linear program of real community problems
 Solve real community problems using linear programming by graphical method

Assumptions

While solving for the linear programming problems, the following assumptions should be
kept in mind so that the best alternative for the objective function will be chosen.

Foremost, Linear Programming assumes linearity in all problems. This means that
expenses components shall add up. Nearly all the expressions of the objective function
associated with these problems will be linear i.e., they will be of the form

3 x+ 2 y + 4 z
 where x , y ∧z are variables. Hence, the assumption of additivity, which asserts that the
total profit of the objective function is determined by the sum of profit contributed by each
product separately. Similarly, the total amount of resources used is determined by the sum of
resources used by each product separately. This implies, there is no interaction between the
decision variables.

Such an expression might represent the profit of a company or the number of units of a
resource required. Frequently the variables will represent the number of units to be produced of
each of the products made by a company.

The coefficients will be drawn from the data given in the problem. Thus, an equation
using this expression would have the form

3 x+ 2 y + 4 z = 50

And an inequality the form

3 x+ 2 y + 4 z ≤ 50.

Such an inequality might express a limitation on a raw material such as iron with the coefficients
3, 2, and 4 representing the units of iron required for a unit of each of the corresponding
products. Note that with these units assigned to the coefficients and the variables x , y ,and ,
each term in the sum has the same units – the number of units of iron – as a result of the
cancellation:

units of iron
4∙ ∙ x unit of product 1=4 x units of iron
unit of product 1

This is a critical observation since meaningful addition of several such terms requires
that they all have the same units.

The third assumption of linear programming is certainty. This means those objective
function coefficients, the coefficients of constraint equation or inequalities, as well as profit or
cost per unit of produce, availability of human resources and man hours, are known with
certainty in the linear programming problem.

Another underlying assumption of linear programming is deterministic. This means that

if we assign a coefficient with certain value, we are certain that it is constant or it will never
change over time and it will not change in a different combination in a solution set.

Next is proportionality. Any change in the constraint inequalities will have the
proportional change in the objective function. For instance, if a product contributes ₱10 towards
the cost, then the contribution to the total cost is ₱50, if there are five units produced; or it would
be ₱250 if there are 25 units produced. Constraints, by the way, can be thought as limited
resources i.e. cost of production, number of staff or administrative hours, or number of men
required.
 The sixth assumption is continuity. The decision variables are continuous and not
solely discrete (or fixed whole number values). This means a combination of outputs can be
used with the fractional values along with the integer values. For instance, one can plant
kamote in 40/3 acres of land and ube in 20/3 acres of land. The fractional or remaining amount,
therefore, will be taken as a work in progress.

Finally, linear programming should assume finite choices. This means that the one
making decision has options with assumption that decision variable have nonnegative value.
Non-negativity constraints should be considered, since the number of cases, number of working
hours, number of human resources, number of acres to be planted cannot be negative.

Graphical Solution of Linear Programs

Solving optimization problems involving linear programming by graphical method entails

meticulous undertaking of processes beginning from identification of decision variables and
constraints, formulation of objective function and equations or inequalities, graphing and
determination of set of feasible solutions as well as the right point that satisfies the objective.

To illustrate, take the following problem:

Problem 1

Nanay Salome wants to plant two root crops for the midyear: kamote (sweet potato) and
ube (winged yam) on her 20 acres of land and wishes to yield maximum revenue. It costs ₱40
to plant an acre of kamote and ₱10 to plant an acre of ube. If previous experience indicates a
return of ₱5 from each acre of kamote and ₱4 from each acre of ube planted, how many acres
of kamote and ube should be planted to maximize revenue, provided that Nanay Salome has
only ₱400 capital.

Problem 1 requires how many acres of kamote and ube should be planted in Nanay
Salome’s land. Note that Nanay Salome wishes a maximum revenue, from planting kamote and
ube on her 20 acres of land, given the costs to plant each root crop, the past record of return of
investment and the ₱400 capital. To help Nanay Salome in deciding how many acres of land
should be planted with kamote and ube, linear programming can be used, thus the following
steps will be undertaken.

Step 1. Identify the decision variable/s and the constraints

There are two (2) decision variables:

1. Number of acres of land to be planted with kamote (let this be x ), and;

2. Number of acres of land to be planted with ube (let this be y ).
There are four (4) constraints: 2 resource constraints and 2 non-negativity constraints

a. Resource constraints
1. Total acres of land
 2. Capital

b. Nonnegativity constraints
a. Acres to be planted with kamote
b. Acres to be planted with ube

Step 2. Formulate the objective function z . Indicate whether it is maximum or minimum

The most common objectives of linear programming are to maximize profit, yield or to
minimize cost or expenses. Let the problem guide you in formulating the objective
function.

Maximize if the maximizing costs, profit, yield are explicitly or implicitly given; or
minimize if explicitly or implicitly stated otherwise.

In Problem 1, the objective is to maximize revenue from planting acres of kamote and
ube.

Analysis 1. Since past experience indicates a return of ₱5 from each acre of kamote
and ₱4 from each acre of ube, 5 and 4 can be coefficients to represent the revenue from
planting x acres of kamote or y acres of ube , respectively. Note that with these units
assigned to the coefficients and the variables, each term in the sum has the same units
– the revenue from planting acres of kamote or ube – as a result of the cancellation:

¿
5 revenue ¿ planting kamote acres of kamote ∙ x acres of kamote=5 x revenue ¿ planting kamote

¿
4 revenue ¿ planting ube acres of ube ∙ x acres of ube=4 y revenue ¿ planting ube

This is a critical observation since meaningful addition of several such terms requires
that they all have the same units,

5 x revenue ¿ planting kamote +4 y revenue ¿ planting ube

¿ revenue ¿ planting root crops(kamote∧ube )

In tabular form,

Table 13.1. Formulation of Revenue Given Decision Variables and Coefficients

Decision Variable Coefficients Revenue

X 5 5x
 Y 4 4y
5x + 4y

Therefore, the objective function to maximize the revenue is

Max: z = 5 x+ 4 y

Where z is the maximum revenue, 5 x is the revenue for planting x acres of kamote and
4 y is the revenue for planting y acres of ube .

Step 3. Formulate the equations or inequalities that express the circumstances

The equations or inequalities are based on the four (4) constraints stated above:

a. Resource constraints (Total acres of land and Capital), and

b. Nonnegativity constraints (Acres to be planted with kamote and acres to be planted
with ube )

For Constraint 1 - Total acres of land, if there are x acres of land to be planted with
kamote and y acres of land to be planted with ube, then the equation or inequality for
total acres of land to be planted with kamote and ube is:

x + y ≤ 20

given that Nanay Salome has only 20 acres of land.

For Constraint 2 - Capital, if it costs ₱40 to plant an acre of kamote and ₱10 to plant
an acre of ube, then the equation or inequality for Capital to be used in planting with
kamote and ube is:

40 x +10 y ≤ 400

given that Nanay Salome has only ₱400 capital.

For Nonegativity Constraints, if x acres is to be planted with kamote and y acres is to

be planted with ube, then the equations and inequalities are

x ≥0

for acres to be planted with kamote, and

y ≥0

for acres to be planted with ube, because it is impossible to have negative 5 acres of
land.
 The formulation of equations or inequalities that express the above constraints is similar
to Analysis 1.

¿
40 cost ¿ planting kamote acres of kamote ∙ x acres of kamote=40 x cost ¿ planting kamote

¿
10 cost ¿ planting ube acres of ube ∙ x acres of ube=10 y cost ¿ planting ube

Thus,

40 x cost ¿ planting kamote +10 y cost ¿ planting ube=total costs ¿ planting root crops (kamote∧ube)

This above formulation of equations or inequalities can be facilitated by a tabular

presentation, as follows:

Table 13.2. Formulation of Equations or Inequalities

Acres of Root Crops Cost per Acre Planted Total Cost

to be Planted
x 40 40 x
y 10 10 y
x+ y 40 x +10 y
Resource limitations
x + y ≤ 20 40 x +10 y ≤ 400
for acres of land for total cost

Step 4. Graph the equations or inequalities and shade the set of feasible solutions called
the critical region

Graphing the equation or inequalities in Step 3 listed below requires knowledge about x -
and y - intercepts.

x + y ≤ 20

40 x +10 y ≤ 400

x≥0

y ≥0
 To graph x + y ≤ 20 , determine the x - and y - intercepts.

x - intercept is the value of x or a point where the graph of touches the horizontal axis or
the x -axis in the famous Rectangular Coordinate System, also known as xy -plane, Cartesian
Coordinate Plane of Cartesian plane.

In Problem 1, the x - intercept is the number of acres of land to be planted with kamote,
when there are no acres of land to be used in planting ube.

y - intercept, on the other hand, is the value of y or a point where the graph of touches
the vertical axis or the y -axis in the infamous Rectangular Coordinate System, also known as
xy -plane, Cartesian Coordinate Plane of Cartesian plane.

In Problem 1, the y - intercept is the number of acres of land to be planted with ube,
when there are no acres of land to be used in planting kamote.

Thus, in + y ≤ 20 , when x=0 , y ≤20 . So the ordered pair will be (0, 20).

And when y=0 , x=20 . So the ordered pair will be (20, 0).

Therefore, the graph x + y ≤ 20 will be as follows:

Fig. 13.1 Graph of x + y ≤ 20

Using the same process, the following are the graphs of 40 x +10 y ≤ 400; x ≥ 0; and y ≥0 ,
respectively.
Fig 13.2 Graph of 40 x +10 y ≤ 400 Fig 13.4 Graph of x≥0 Fig 13.4 Graph of y ≥0

Graph them in one Cartesian plane, as shown below:

 40 x +10 y ≤ 400

x≥0

x + y ≤ 20

y ≥0

Fig. 13.5 Graphs of + y ≤ 20 , 40 x +10 y ≤ 400 , x ≥ 0, y ≥0

The critical region is the region shaded in green, the quadrilateral ACEO. This is where
all graphs of the constraints overlap. The points above the line in red do not belong to the
feasible region.

Step 5. Determine the critical points

The critical points are corners of the critical region. As shown in the Figure, there are six
(6) points identified: the origin, O (0,0), the x-intercepts A (20,0) and E(10,0), the y-
intercepts B (0,20), and D(0,40); and the point of intersection of the equation of
constraints 40 x +10 y ≤ 400 and x + y ≤ 20 which is C (20/3,40/3).

However, only four (4) points: O (0,0), B(0,20), C (20/3, 40/3), and E (10,0) are said to
be critical points or corners of the critical region or set of feasible solution. These points
will be used to determine what produces maximum value of the objective function.
 x = 20/3 and y = 40/3 can be determined using the process of elimination or
substitution.

Solving the system of equations by SUBSTITUTION involves the following steps.

Step 5.1a. Solve for x in terms of y in the first equation: x + y=20.
x+ y = 20 Given
x + y +(− y) = 20 + (− y ¿ Addition Property of Equality (APE)
x = 20− y

Step 5.2a . Substitute : x=20− y to the other equation 40 x +10 y=400.

40 x +10 y = 400 Given
40 ( 20− y ) +10 y = 400 Substitution Property
800−40 y +10 y = 400 Simplify both sides of the equation
800−30 y = 400
800+(−800)−30 y = 400+(−800) Addition Property of Equality (APE)
−30 y = −400 −1
Multiply both sides by
30
Y = 40
3

40
Step 5.3a. Substitute : y= to the first equation x + y=20
3
x+ y = 20 Given
40 = 20 Substitution Property
( )
x+
3
40 −40 = −40 Addition Property of Equality (APE)
x + +(
3 ) ( )
20+
3 3
X = 20
3
So x = 20/3 and y = 40/3

Solving the system of equations by ELIMINATION involves the following steps.

Step 5.2a. Decide what variable to be eliminated. To eliminate x , multiply the first
equation by -40 and let the result be equation 3
x + y = 20 Given
−40¿ = 20 ¿ Multiplication Property of Equality
−40 x−40 y = −800

Step 5.3a . Add the equation 40 x +10 y=400and the equation 3.

 40 x +10 y = 400 Given
−40 x−40 y = −800 Given equation 3
40 x + (−40 x ) +10 y +(−40 y) = 400+(−800) Sum
−30 y = −400 −1
Multiply both sides by
30
y = 40
3

40
Step 5.3a. Substitute : y= to the first equation x + y=20
3
x+ y = 20 Given
= 20 Substitution Property
( 403 )
x+

40 −40 = Addition Property of Equality (APE)

x + +(
3 3 )
20+ ( −403 )
x = 20
3
So x = 20/3 and y = 40/3

Step 6. Choose the point producing the maximum (or minimum value) of the objective
function

In choosing the point that satisfies the objective function z, apply points to the function.

Table 13.3. Objective Function Values

Acres of land Objective Objective

Acres of land for
Point for planning Function Function
planning ube (y)
kamote (x) z = 5 x+ 4 y Value
(0,0) 0 0 5(0)+4(0) 0
(0,20) 0 20 5(0)+4(20) 80
(20,0) 20 0 5(20)+4(0) 100
(20/3,40/3) 20 / 3 40 / 3 5(20/3)+4(40/3) 260 / 3
(0,40) 0 40 5(0)+4(40) 160
(10,0) 10 0 5(10)+4(0) 50

If we consider all six (6) identified points stated above, the pair which yield the maximum value
is (0, 40), followed by (20,0), then (20/3, 40/3); however the two points (20,0) and (0,40) cannot
be considered since they do not satisfy all the four (4) constraints. Therefore, they will be
excluded.

Table 13.4. Determining Whether a Point is Feasible Solution

Points Constraints
 (x,y) x + y ≤ 20 40 x +10 y ≤ 400 x≥0 y ≥0

(20,0) True Not true True True

(0,40) Not true True True True

For the point (20,0), it satisfies all the constraints, EXCEPT 40 x +10 y ≤ 400 , since
40(20)+10(0) = 800 is not less than or equal to 400; while, for the point (0,40), it satisfies all the
constraints, EXCEPT x + y ≤ 20 , since 0+40 = 40 is not less than or equal to 20.

Table 13.5. Determining the Solution to the Objective Function

Acres of land Objective Objective

Acres of land for
Point for planning Function Function
planning ube (y)
kamote (x) z = 5 x+ 4 y Value
(0,0) 0 0 5(0)+4(0) 0
(0,20) 0 20 5(0)+4(20) 80
(20/3,40/3) 20 / 3 40 / 3 5(20/3)+4(40/3) 260 / 3
(10,0) 10 0 5(10)+4(0) 50

Thus, among the four (4) critical points, (20/3, 40/3) will be the solution that yields the
maximum value. This means 20/3 acres will be planted with kamote, while 40/3 acres will
be planted with ube, so as to gain the maximum revenue of 260/3 or ₱86.66.

Example 1.

The Local Government Unit (LGU) is planning to maximize the total number of
Ombudsman cases filed against officials and employees. Normally, LGU deals with cases
categorized into two: Type X and Type Y. LGU has been provided with a ₱40,000 budget, 3000
staff hours, and 3000 administrative hours. It usually takes 30 staff hours to complete each Type
X case and 10 staff hours for a Type Y case. Also, each Type X and Type Y case costs the
same ₱200 to complete. A Type X case uses 10 administrative hours, while a Type Y takes 30
administrative hours. How many Type X and Y Ombudsman cases shall the LGU file?

Step 1. Identify the decision variable/s and the constraints

There are two (2) decision variables:

1. Number of Type X Ombudsman cases shall the LGU file (let this be x ), and;
2. Number of Type Y Ombudsman cases shall the LGU file (let this be y ).

There are five (5) constraints: 3 resource constraints and 2 non-negativity constraints

a. Resource constraints
1. Budget
2. Staff hours
 3. Administrative hours

b. Nonnegativity constraints
1. Number of Type X cases
2. Number of Type Y cases

Step 2. Formulate the objective function z . Indicate whether it is maximum or minimum

In Example 1, the objective is to maximize the total number of Ombudsman cases filed
against officials and employees

Table 13.6a. Formulation of Total Number of Cases Given Decision Variables and
Coefficients

Decision Variable Coefficients Revenue

X 1 x
Y 1 y
x+y

Therefore, the objective function to maximize is

Max: z = x+ y

Step 3. Formulate the equations or inequalities that express the circumstances

The equations or inequalities are based on the five (5) constraints stated above: three
(3) Resource constraints, namely: Budget, Staff hours, and Administrative hours; and
Nonnegativity constraints: Number of Type X cases and Number of Type Y cases.

This formulation of equations or inequalities can be facilitated by a tabular presentation,

as follows:

Table 13.6b. Formulation of Equations or Inequalities

Types of Budget Total Staff Total Staff Administrativ Total

Cases per Budget Per Hours Hours e Hours Used Administrative
case Case Used Used per per Case Hours Used
per Case per Case
Case
x 200 200 x 30 30 x 10 10 x
y 200 200 y 10 10 y 30 30 y
Resource 40,000 3,000 3,000
limit
Equation 150 x+150 y ≤ 40,000 30 x+ 10 y ≤ 3,000 10 x+ 30 y ≤ 3,000
or
 inequalit
y
Thus, the Resource constraints are:

200 x+ 200 y ≤ 40,000

30 x+ 10 y ≤ 3000
10 x+ 30 y ≤ 3,000
And the Nonegativity Constraints are:

x ≥0 and y ≥0

Step 4. Graph the equations or inequalities and shade the set of feasible solutions called
the critical region

Graph the equation or inequalities in Step 3 using the x - and y - intercepts in one
Cartesian plane, same as shown below:

30 x+ 10 y ≤ 3,000

200 x+ 200 y ≤ 40,000

x≥0
10 x+ 30 y ≤ 3,000

y ≥0
Fig. 13.6 Graphs of 200 x+ 200 y ≤ 40,000 , 30 x+ 10 y ≤ 3,000, 10 x+ 30 y ≤ 3,000 , x ≥ 0 , y ≥0

The critical region is the quadrilateral OHGF. The points above the line in red do not
belong to the feasible region.

Step 5. Determine the critical points

By determining the x – and y−¿intercepts and point of intersection, the critical points O
(0,0), H (0, 100), G (75,75), and F (100,0) are determined.

Step 6. Choose the point producing the maximum (or minimum value) of the objective
function

In choosing the point that satisfies the objective function z, apply points to the function.

Table 13.6c. Determining the Solution to the Objective Function

Objective Objective
Number of Number of Type X
Point Function Function
Type X cases cases
z = x+ y Value
O (0,0) 0 0 0+0 0
F (100,0) 100 0 100+0 100
G (75, 75) 75 75 75+75 150
H (0,100) 0 100 0+100 100
Fig. 13.6 Critical Points

Thus, among the four (4) critical points, (75, 75) will be the solution that yields the
maximum total number of Ombudsman cases filed against officials and employees. This
means 75 cases of Type X and also 75 cases of Type Y shall be filed by LGU .

Example 2.

A Food Chemist was requested by the PESA director of Jose Rizal Memorial State University
(JRMSU) to develop food that varsity players can eat during their training programs. The
Chemist intends to mix two separate products M and N, with consideration of the following data:

Supplements Minimum Cost Cost Contribution per ounce (grams)

required
Product M Product N
Calcium 50 1 5
Selenium 120 4 1
Magnesium 80 2 4
Zinc 60 3 2

Product M costs ₱10 per ounce while product N costs ₱20 per ounce. Determine the product
mix that will give minimal cost.

Steps Solution
Ste Identify the decision Let x be the ounces of Product M
p1 variable/s and the
and y be the ounces of Product N
constraints
There are 4 resources constraints (Cost for Calcium,
Selenium, Magnesium, and Zinc) and 2 nonnegativity
constraint
Ste Formulate the Minimize: z=10 x+ 20 y
p2 objective function z .
Indicate whether it is
Since Product M costs ₱10 per ounce while
maximum or minimum
product N costs ₱20 per ounce

Ste Formulate the Subject to: x +5 y ≥ 50 (Constraint 1)

p3 equations or 4 x+ y ≥ 120 (Constraint 2)
inequalities that 2 x+ 4 y ≥ 80(Constraint 3)
express the 3 x+ 2 y ≥ 60(Constraint 4)
circumstances x≥0 (Nonnegativity Constraint 1)
y ≥0 (Nonnegativity Constraint 2)

Ste Graph the equations

p4 or inequalities and
shade the set of
feasible solutions
called the critical
region

Ste Determine the critical

p5 points
Poin
X Y
t
B 50 0
D 100 / 3 10 / 3
F 0 120
H 200 / 7 40 / 7
 Ste Choose the point
p6 producing the Value of
maximum (or the
minimum value) of the Poi
X Y objective
objective function nt
function
(Z)
B 50 0 500
D 100 / 3 10 / 3 400
F 0 120 2400
H 200 / 7 40 / 7 400

In the table, the ordered pair H(200/7, 40/7)

has the minimum value of the objective
function which is 400.

Thus, the product mix that will give minimal

cost is 200/7 or about 28.57 ounce of
Product M and 40/7 or 5.71 ounce of
Product N.

Learning Activities

Activity 1. Solve the following problems. Solve it using graphical method.

1. A&B manufactures two electrical products: electric iron and electric fans. The assembly
process for each is similar in that both require a certain amount of wiring and drilling.
Each electric iron must go through 2 hours of wiring and 1 hour of drilling. Each electric
fan takes 3 hours of wiring and 2 hours of drilling. During the next production period, 240
hours of wiring time is available and up to 140 hours of drilling time may be used. Each
electric iron sold yields ₱150 profit. How many units of both products should A&B
produce in order to obtain the largest possible profit?

a. Identify the decision variable/s and the constraints.

b. Formulate the objective function z . Indicate whether it is maximum or minimum
c. Formulate the equations or inequalities that express the circumstances.
d. Set up an initial table or tableau and obtain initial basic solution
e. Convert the constraints to canonical form by inserting slack, artificial or surplus
variables in the constraints, excluding nonnegativity constraints
f. Determine the entering and leaving (or departing) basic variable and obtain the new
remaining rows
g. Construct the simplex tableau, determine solutions and make decision
 2. You are making fruit baskets with oranges, bananas, and apples. The table gives the
amount of fruit required for the two arrangements. Each day you have 240 oranges, 270
bananas and 320 apples. Arrangement A earns a profit of ₱10 per basket and
Arrangement B earns ₱8 per basket. How many of each fruit basket should you make
per day to maximize your profit?

a. Identify the decision variable/s and the constraints.

b. Formulate the objective function z . Indicate whether it is maximum or minimum
c. Formulate the equations or inequalities that express the circumstances.
d. Set up an initial table or tableau and obtain initial basic solution
e. Convert the constraints to canonical form by inserting slack, artificial or surplus
variables in the constraints, excluding nonnegativity constraints
f. Determine the entering and leaving (or departing) basic variable and obtain the new
remaining rows
g. Construct the simplex tableau, determine solutions and make decision

Thank you for trying to answer the activity. If you have solved it without difficulty, go to
Unit II of this module. If you want to solve linear program problems, go to
http://www.phpsimplex.com/simplex/page4.php?f=1&l=en. You may go to the next
activity with instructions below to level up your performance.

If you have problems, feel free to contact me through SMS, phone calls or via email
indicated in the course syllabus.

Activity 2. Visit any store in your community, for example, a fruit store. Help the seller in
maximizing his profit. Do the following:

a. Identify the decision variable/s and the constraints

b. Formulate the objective function z . Indicate whether it is maximum or minimum
c. Formulate the equations or inequalities that express the circumstances
d. Graph the equations or inequalities and shade the set of feasible solutions called the
critical region
e. Determine the critical points
f. Choose the point producing the maximum (or minimum value) of the objective function
 Rubric

Rubric A. Analytical Rubric in Scoring Performance Task

Criterion Very Good Good Fair Poor

4 3 2 1
Understanding Demonstrates Demonstrates Demonstrates Demonstrates
and complete nearly complete some limited or no
Compliance understanding understanding understanding understanding
of the required of the required of the required of the required
task task task task

The output The output The output The output

completely addresses addresses addresses none
addresses all almost all the some, but not of the required
the required required tasks. all the required tasks.
tasks. tasks.

Accuracy 91%-100% of all 75% - 90% of all 50% - 74% of all 49% or below of
item answers item answers item answers all item answers
correct. are correct. are correct are correct.
 Index

Linear Program 1

Constraint 1, 2, 5, 8

Graphical solutions 2, 3, 4, 5

Tableau, 13
 Glossary

Algorithm. Process of making a linear program.

Linear expression. A mathematical expression where the degree of the variable

is one and only 1.

Graphical solution. This solution makes use of x-y plane in solving problems.
 Answer to Exercises

Activity 1

1. 134
2. 12
 References

Altares, et. al (2004). Qualitative Techniques for Business with Computer Applications. Rex
Bookstore.

Bradley, Stephen P., Arnolod C. Hax, and Thomas L. Magnanti (1977). Applied Mathematical
Programming. Addison-Wesley Publishing Company.

Dantzig, George B. (1963). Linear Programming and Extensions. Princeton University Press.

Hillier, Frederick S., and Gerald J. Lieberman (1990). Introduction to Mathematical

Programming. McGraw-Hill, Inc.

Tools for graphing

https://www.desmos.com/calculator

http://www.phpsimplex.com/simplex/page4.php?f=1&l=en