LINEAR

PROGRAMMING
- Graphical Method
Graphical Method for
Solving Linear Programming [STEPS]
1. Graph the system of constraints. This will give the
feasible set.
2. Find each vertex (corner point) of the feasible set.
3. Substitute each vertex into the objective function to
determine which vertex optimizes the objective
function.
4. State the solution to the problem
Example
Use the graphical method to solve the following linear programming problem:
Maximize R = 4x + 11y
Subject to:
x + y ≤ 3
2x + y ≤ 4
x >= 0
y >= 0
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Step 1.1: Rewrite each inequality as an equation
x + y ≤ 3 → x+y= 3 (1)
2x + y ≤ 4 → 2x + y = 4 (2)
x >= 0 (3)
y >= 0 (4)
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Step 1.2: To graph each contraint, find the intercepts
Equation (1) x+y= 3
x-intercept y-intercept
x+y=3 x+y=3
x+0=3 0+y=3
x=3 y=3
Therefore, the x- and y-intercepts for equation (1) are:
(3,0) and (0,3)
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Step 1.2: To graph each contraint, find the intercepts
Equation (2) 2x + y = 4
x-intercept y-intercept
2x + y = 4 2x + y = 4
2x + 0 = 4 2(0) + y = 4
2x = 4 0+y=4
x=2 y=4
Therefore, the x- and y-intercepts for equation (2) are:
(2,0) and (0,4)
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Step 1.2: To graph each contraint, find the intercepts
Equation (3) x >= 0
Equation (4) y >= 0
represents the x-axis and y-axis, respectively that together
represent the first quadrant
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Equation (1) x + y = 3
intercepts:
(3,0) and (0,3)

Equation (2) 2x + y = 4 (0,4) Equation (2)

intercepts: Equation (1) (0,3)
(2,0) and (0,4)

Equations (3) and (4)

represent the x-axis and y- (3,0) Equation (1)
axis, respectively, that is
>=0 (positive), Quadrant I
should be shaded
(2,0) Equation (2)
 STEP 2:
Solution Find each vertex (corner point) of the
feasible set.
Choose test point to determine
which half plane to shade.

Ex: Test point (0,0)

x + y ≤ 3
0 + 0 ≤ 3
0 ≤ 3 True
(0,3)
(1,2) 2x + y ≤ 4
2(0) + 0 ≤ 4
0 ≤ 4 True
-----------------
(0,0) Ex: Test point (3,4)
2x + y ≤ 4
2(3) + 4 ≤ 4
(2,0) 6 + 4 ≤ 4
10 ≤ 4 False
 STEP 3:

Solution
Substitute each vertex into the objective function
to determine which vertex optimizes the objective
function.
Solution STEP 4:
State the solution to the problem.
Optimal Solution:

The maximum value is 33 and it occurs at (0, 3) .

Example:
Profit Maximization Linear Programming Problem
➢ The company uses wood and labor to produce tables and chairs. Unit
profit for tables is Php300 and unit profit for chairs is Php400. There are
300 board feet (bf) of wood available, and 110 hours of labor available. It
takes 30 bf and 5 hours to make a table, and 20 bf and 10 hours to
make a chair. The company’s management wishes to maximize unit
profit.

Resource Table (x) Chair (y) Available

Wood 30 20 300
Labor 5 10 110
Unit profit 300 400
Linear Programming Problem
• Maximize :
Z = 300x + 400y (objective function)
maximize profit(Z)

• Subject to :
30x + 20y ≤ 300 (wood constraint)
5x + 10y ≤ 110 (labor constraint)
x, y >= 0
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Step 1.1: Rewrite each inequality as an equation
30x + 20y ≤ 300 → 30x + 20y = 300 (1)
5x + 10y ≤ 110 → 5x + 10y = 110 (2)
x >= 0 (3)
y >= 0 (4)
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Step 1.2: To graph each contraint, find the intercepts
Equation (1): Wood 30x + 20y = 300
x-intercept y-intercept
30x + 20y = 300 30x + 20y = 300
30x + 20(0) = 300 30(0) + 20y =
30x = 300 20y = 300
x = 10 (tables) y = 15 (chairs)
Therefore, the x- and y-intercepts for equation (1) are:
(10,0)and (0,15)
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Step 1.2: To graph each contraint, find the intercepts
Equation (2): Labor 5x + 10y = 110
x-intercept y-intercept
5x + 10y = 110 5x + 10y = 110
5x + 10(0) = 110 5(0) + 10y = 110
5x = 110 10y = 110
x = 22 tables y = 11 chairs
Therefore, the x- and y-intercepts for equation (2) are:
(22,0)and (0,11)
 STEP 1:
Solution Graph the system of constraints to
produce the feasible set.
Equation (1) 30x + 20y = 300
intercepts: (0,15) Equation (1)

(10,0) and (0,15)

Equation (2) 5x + 10y = 110 Equation (2) (0,11)

intercepts:
(22,0) and (0,11)

Equations (3) and (4)

represent the x-axis and y-
axis, respectively, that is
>=0 (positive), Quadrant I (22,0) Equation (2)

should be shaded
(10,0) Equation (1)
 STEP 2:
Solution Find each vertex (corner point) of the
feasible set.
Choose test point to determine
which half plane to shade.

Ex: Test point (0,0)

30x + 20y ≤ 300
30(0) + 20(0) ≤ 300
0 ≤ 300 True

5x + 10y ≤ 110
5(0) + 10(0) ≤ 110
0 ≤ 110 True
-----------------
Ex: Test point (10,15)
5(10) + 10(15) ≤ 110
50 + 150 ≤ 110
200 ≤ 110 False
 STEP 3:

Solution
Substitute each vertex into the objective function
to determine which vertex optimizes the objective
function.

Vertex of the Feasible Set Value of Z = 300x + 400y

(0 , 11) Z = 300(0) + 400(11) = 4,400

(4 , 9) Z = 300(4) + 400(9) = 4,800

(10 , 0) Z = 300(10) + 400(0) = 3,000

Solution STEP 4:
State the solution to the problem.
Optimal Solution:
The maximum profit of 4,800 can be obtained by
producing four (4) tables and nine (9) chairs.
Thank you for your attention.