Lesson 6.

Linear Programming
One of the goals of this course is to learn how to manage limited resources without sacrificing
a certain target. Linear Programming is a mathematical method of finding the best solution
to a certain objective subject to a given set of constraints. In business, linear programming is
finding the optimal solution to a certain objective function (maximizing profit or minimizing
cost)given scarce resources (constraints). These constraints are expressed as linear inequalities
while the objective function is a linear function.

Graphical Method
This is a type of linear programming involving two variables which uses graphing of linear
inequalities to find the optimal solution. The optimal solution is usually maximizing profit or
minimizing cost.
Steps in Graphical Method are:
1. Graph the linear inequalities of the constraints to determine the area of feasible
solution, i.e., it contains the set of all points that satisfy all conditions in the
constraints.
2. Identify the corner points/vertices (critical points) of the polygon representing
the feasible region. Theses points can be identified graphically. When graphical
identification is not possible, the critical points can also be identified analytically
using elimination when solving system of equations in two unknowns.
3. Compute for the value of the objective function at each of the critical points.
4. Select the point where the value of the objective function is greatest for maximiza-
tion problem and the least value of the objective function for minimization problem.
5. State your conclusion.
Example 6.1: Shade the region representing the solution set (area of feasible solution)
of the following set of inequalities.(recall graphing of inequalities in two variables)
(a) 3x + y ≤ 6, 4x + 3y ≥ 12, x ≥ 0, and y ≥ 0
ˆ Solution:

ˆ The shaded triangle color yellow above represents the solution set using a graph-
ing calculator called DESMOS.

1
 ˆ The same solution can be obtained manually (without using DESMOS) by
watching the video of this lesson.
(b) 5x + 3y ≤ 15, 8x + y ≤ 8, x ≥ 0, and y ≥ 0
ˆ Solution:
ˆ The shaded polygon color yellow below represents the solution set using a graph-
ing calculator called DESMOS.

ˆ The same solution can be obtained manually (without using DESMOS) by

watching the video of this lesson.
Example 6.2: Minimize the objective function z = 10x + 9y subject to the constraints
3x + y ≤ 6, 4x + 3y ≥ 12, x ≥ 0, and y ≥ 0.
ˆ Solution:
ˆ Graph the linear inequalities of the constraints. Refer to example 6.1a
ˆ The critical points are A(0, 4), B(0, 6) and C(1.2, 2.4).
critical points computation of z z value
A(0, 4) 10(0) + 9(4) 36
ˆ
B(0, 6) 10(0) + 9(6) 54
C(1.2, 2.4) 10(1.2) + 9(2.4) 33.6
ˆ Since this is a minimization problem, then select C(1,2, 2.4).
ˆ Conclusion: 1.2 units of x and 2.4 units of y will minimize the objective function z.

Example 6.3: Maximize the objective function z = 23x + 17y subject to the constraints
5x + 3y ≤ 15, 8x + y ≤ 8, x ≥ 0, and y ≥ 0.
ˆ Solution:
ˆ Graph the linear inequalities of the constraints. Refer to example 6.1b
ˆ The critical points are A(0, 0), B(0, 5), C(0.474, 4.211) and D(1, 0).
critical points computation of z z value
A(0, 0) 23(0) + 17(0) 0
ˆ B(0, 5) 23(0) + 17(6) 102
C(0.474, 4.211) 23(0.474) + 17(4.211) 82.489
D(1, 0) 23(1) + 17(0) 23

2
 ˆ Since this is a maximization problem, then select B(0, 5).
ˆ Conclusion: 0 units of x and 5 units of y will maximize the objective function z.

Example 6.4: Mr. Guevarra operates an Eco-tourist Park by renting UTV vehicle and
motorcycle rides. He has a total of 25 vehicles available for rental in a day. Each UTV
vehicle is rented at Php 350/day while each motorcycle is rented at Php 150/day. To
be sustainable, his total earnings/day from rentals should at least be Php 2000 If his
profit is Php 200/day for each UTV vehicle and Php 90/day for each motorcycle, How
many of each type of vehicle should be rented in order to maximize profit? Formulate
the objective function and constraints, and then solve.

ˆ Solution:
ˆ Let x = the number of units of UTV vehicles rented, and let y = the number of
units of motorcycles rented.
ˆ The objective function is Maximize z = 200x+90y subject to the constraints x+y ≤
25, 350x + 150y ≥ 2000, x ≥ 0, and y ≥ 0.
ˆ Graph the linear inequalities of the constraints and find the area of feasible solution
color yellow as shown below.

ˆ The critical points are A(0, 13.33), B(0, 25), C(5.71, 0) and D(25, 0).
critical points computation of z z value
A(0, 13.33) 200(0) + 90(13.33) 1199.70
ˆ B(0, 25) 200(0) + 90(25) 2250
C(5.71, 0) 200(5.71) + 90(0) 1142
D(25, 0) 200(25) + 90(0) 5000
ˆ Since this is a maximization problem, then select B(25, 0).
ˆ Conclusion: 25 units of x and 0 units of y will maximize the objective function z.
That is. a rental of 25 units of UTV vehicles only is enough to maximize his profit
of Php 5000.

3
 Example 6.5: A farmer buys two chicken feeds (A and B) to raise his chicken. Feed A
costs Php 20/kg and Feed B costs Php 40/kg. Each kg of Feed A contains 3000 units
of vitamin V1 and 1000 units of vitamin V2. Each kg of Feed B contains 4000 units of
vitamin V1 and 4000 units of vitamin V2. If the minimum daily requirements for the
chickens collectively are 36000 units of vitamin V1 and 20000 units of vitamin V2, how
many kg of each feed should be used each day to minimize daily feed costs while meeting
the minimum daily vitamin requirements? What is the minimum daily cost? (Please see
video)

Assignment L-6.1
Solve for the following linear programming problem graphically:

1. Maximize: Z = 5x + 3y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0

2. Minimize: Z = x + 2y subject to 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, y ≥ 0

3. The Chiffon cake requires 200 g of flour and 25 g of fat, and the Banana cake requires
100 g of flour and 50 g of fat. Find the maximum number of Chiffon and Banana Cakes
which can be made from 5 kg (5000 g) of flour and 1 kg (1000 g) of fat assuming that
there is no shortage of the other ingredients used in making the cakes.