©C.
Jove, 2022
LINEAR PROGRAMMING
Linear Programming was developed by George Dantzig during the 1940s which he used for the purpose of
planning during war. Linear Programming starts with a problem which is then used to perform analysis to
determine the quantities that would either maximize profit or minimize cost (budget and sales).
[page 139 A Course Module for MMW by Manlulu and Hipolito,2019]
GUIDE FOR SHADING FEASIBLE REGIONS
A. Vertical line
≤ or < shade to the left
≥ or > s hade to the right
B. Horizontal line
≤ or < shade below
≥ or > shade above
C. Slant Line
≤ or < shade below
≥ or > shade above
SOLVING LINEAR PROGRAMMING USING GRAPHICAL METHOD
A. MAXIMIZATION
A company makes 2 types of computers, X & Y.
The company can make a total of 80 computers per day, and it has 240 work hours available per day.
It takes 2 work hours to make computer X & 6 work hours to make computer Y.
The profit from computer X is $80.
The profit from computer Y is $120.
How many of each should be made to maximize profit?
OBJECTIVE FUNCTION: Max P = 80x + 120y
STRUCTURAL CONSTRAINTS: 1). x+y ≤ 80 (shade below)
2). 2x + 6y ≤ 240 (shade below)
NON-NEGATIVITY CONSTRAINTS: 3). x≥0
4). y≥0
Step 1: Get x- & y-intercepts of each structural constraint.
Equation 1: x+y = 80
x=0, y=?
x+y = 80
0+y = 80
y = 80 Point 1=P1(0,80)
y=0, x=?
x+y = 80
x+0 = 80
x = 80 P2(80,0)
Equation 2: 2x + 6y = 240
x=0, y=?
2x + 6y = 240
2(0) + 6y = 240
0 + 6y = 240
6y = 240
y = 40 P3(0,40)
y=0, x=?
2x + 6y = 240
2x + 6(0) = 240
2x = 240
x = 120 P4(120,0)
©C.Jove, 2022
Step 2: Plot points and shade feasibility region.
www.AtoZmath.com
Step 3: Identify corner points
A(0,40) B(80,0) C(intersection of Lines 1&2)
Can be solved using elimination or substitution.
ELIMINATION
2x + 6y = 240
-6(x+y) = 80
2x + 6y = 240
-6x - 6y = -480
-4x = -240
x = 60
SUBSTITUTION:
Equation 1:
x + y = 80
x = 80-y
Substitute x to Equation 2: 2x + 6y = 240
2(80-y) + 6y = 240
160 - 2y + 6y = 240
4y = 240-160
4y = 80
y = 20
A(0,40) B(80,0) C(60,20)
Step 4: Solve using the objective function.
Max P = 80x + 120y
P(A) = 80(0) + 120(40) = $4,800
P(B) = 80(80) + 120(0) = $6,400
P(A) = 80(60) + 120(40) = $7,200
Making 60 Computer X and 20 Computer Y would maximize profit.
Optimum Point: C(60,40)
Optimum Solution: x=60, y=40
Optimum Value: 7200
©C.Jove, 2022
B. MINIMIZATION
A chicken farmer uses a mixture of 2 chicken feeds, Chicken’s Best (X) and Chicken Meal (Y).
Each ounce of X contains 12g protein, 2g fat, 16g carbohydrates.
Each ounce of Y contains 6g protein, 1g fat, 18g carbohydrates.
X costs 7 pesos per ounce.
Y costs 5 pesos per ounce.
The feeds that the chicken farmer buys must contain at least 60g protein, 8g fat, and at most 180
carbohydrates.
Determine the number of ounces of X and Y feeds that will produce a mixture satisfying the given
restrictions at minimum cost.
X Y
Protein 12g 6g
Fat 2g 1g
Carbohydrates 16g 18g
OBJECTIVE FUNCTION: Min C = 7x + 5y
STRUCTURAL CONSTRAINTS: 1). 12x + 6y ≥ 60 (shade above)
2). 2x + y ≥ 8 (shade above)
3). 16x + 18y ≤ 180 (shade below)
Step 1: Get x- & y-intercepts of each structural constraint.
Equation 1: 12x + 6y = 60
x=0, y=?
12x + 6y = 60
12(0) + 6y = 60
6y = 60
y = 10 P1(0,10)
y=0, x=?
12x + 6(0) = 60
12x = 60
.x=5 P2(80,0)
Equation 2: 2x + y = 8
x=0, y=?
2x + y = 8
2(0) + y = 8
y=8 P3(0,8)
y=0, x=?
2x + y = 8
2x + 0 = 8
2x = 8
x=4 P4(4,0)
Equation 3: 16x + 18y = 180
x=0, y=?
16x + 18y = 180
16(0) + 18y = 180
18y = 180
y = 10 P5(0,10)
y=0, x=?
16x + 18y = 180
16x + 18(0) = 180
16x = 180
x =1114 or 11.25 P5(11.25,0)
©C.Jove, 2022
Step 2: Plot points and shade feasibility region.
www.AtoZmath.com
Step 3: Identify corner points
A(0,10) B(5,0) C(11.25,0)
Step 4: Solve using the objective function.
Min C = 7x + 5y
C(A) = 7(0) + 5(10) = 50 pesos
C(B) = 7(5) + 5(0) = 35 pesos
C(C) = 7(11.25) + 5(0) = 78.75 pesos
To minimize cost and meet the nutritional requirements, 5 ounces Chicken’s Best (X) and 0 ounces
Chicken Meal (Y) should be mixed.
Optimum Point: B(5,0)
Optimum Solution: x=5, y=0
Optimum Value: 35
SOURCES:
Maximization
Mario’s Math Tutoring. (2017, March 2). Linear Programming. YouTube.
https://www.youtube.com/watch?v=reKV1lRn_uw
Minimization:
Patrick Louie Reyes. (2021, April 14). Linear Programming - Minimization. YouTube.
https://www.youtube.com/watch?v=ebhaNTASZkM
Graphing Linear Programming:
Shah, P. N. (2022). AtoZmath.com – Linear Programming (with all solution steps).
http://www.AtoZmath.com
