Professional Documents
Culture Documents
Contact Details
Contact Number: 09167422338/09184922805
E-mail Address: Momsureta28@gmail.com
Web Address: [Type your web address or social media link]
Consultation Schedule
Every Friday 2 -5 pm
In addition, students will undergo pre-test and post-test short-examination. The pre-test questionnaires will
be given at the start of each rating period (Prelims, Midterms, Finals) while the post-test questionnaires will
be given at the end of each rating period. The results of the assessment will serve as one of the key
indicators that determine the effectiveness of this learning material. Thus, exemplifying honesty and
rectitude in this particular undertaking are highly appreciated and commendable.
Always keep connected and updated with announcements and relevant information concerning this course.
Lastly, do not hesitate to ask for assistance and raise your concerns to your instructor / professor.
In this Chapter, techniques on how to optimize things will be discussed like linear programming. Linear
programming (LP) is one of the simplest ways to perform optimization. It helps you solve very complex
optimization problems by making a few simplifying assumptions. As an analyst you are bound to come
across applications and problems to be solved by Linear Programming.
(https://www.analyticsvidhya.com/blog/2017/introductory-guide-on-linear-programming-explained-in-simple-
english/)
Ax + By ≥ C Ax + By ≤ C (mixed inequality)
Where A, B and C are constants, and A and B are not both zero, are inequalities of the first degree in
two variables.
Steps:
1. Replace the inequality symbols with equality. This is the equation of the boundary line of the desired
region which is considered the solution or feasibility region.
2. Graph the boundary line. (If the inequality involves ≥ 𝑜𝑟 ≤ , the boundary line is solid indicating that
the points in the line are included in the solution. If the inequality is > 𝑜𝑟 < , a broken line is used
indicating that the points on the line are not solutions of line inequality.)
3. Choose a point not on the boundary line, if possible (0, 0) and substitute the coordinates in the given
inequality.
4. If the point satisfies the inequality, shade the region containing it. Otherwise, shade the region on the
other side of the boundary line. The shaded region is the solution.
Examples:
1. Graph 𝑦 > 2x + 4
Step 1: The equation is y = 2x + 4. Take ordered pairs (0, 4) and (-2, 0).
These are the intercepts of the equation. Then graph on the Cartesian plane.
Step 2: The boundary line is broken line since the inequality is strict. (>)
Step 3: Choose (0, 0) and test in the given inequality from 𝑦 > 2x + 4.
Therefore, 0 is > 2(0) + 4 can be simplified as 0 > 4.
Step 4: 0 > 4 is not true; hence, shade the other side of the boundary line. (not in the region where
(0, 0) is located)
Activity 1 (Application)
1. x + y > 4
2. x + y < 4
3. x + y ≥ 4
4. x + y ≤ 4
5. 3x + 5y < x + 4y + 4
Activity 2 (Application)
1. a. 2x – y < 3
b. x + y ≤ 6
2. a. x + y ≥ 3
b. x + y ≤ 2
3. a. 3x + 4y ≥ 12
b. x > 4
c. y < 5
Activity 3 (Application)
Solve for the optimal solution of the given Linear Programming Problems:
1. Draw the figure and find the maximum and minimum values of f(x) = 2x – 3y + 4 in
the region S with vertices at
2. Find the minimum and maximum values of the function, f(x, y) = 5x + 6y subject to the
following constraints: 2y – x ≤ 4, 3x – y ≤ 3, x ≥ 0, y ≥ 0.
References:
Rodriguez, Mary Joy J., et al, Mathematics In The Modern World © 2018
Nocon, Rizalde C. & Nocon, Erlinda G., Essential Mathematics for the Modern World © 2018