Topic: Linear Programming – Graphic Method

Is a mathematical tool that helps find the best use of man’s limited resources.
It consists of steps that will lead to an optimization solutions to linear-constrained problems.
Graphical linear programming provides a visual portrayal pf the many concepts of linear programming,
but is limited to problems with only two variables.

Four components that provide the structure of a linear programming model;

1. Objective function. It is a mathematical expression that can be used to determine the actual profit or
cost for a given solution.
2. Decision variables. Variables are those that we want to measure, and its quantity.
3. Constraints. Limitations that restrict the alternatives that are available to decision makers.
Constraints are either less than or equal to ( ≤ ) or greater than or equal to ( ≥ ) or equal to ( = )
4. Feasible solution space. The set of all feasible combinations of decision variables as defined by the
constraints.

Sample Problem. Dimensions Ltd is a manufacturing Plant that produces tables and chairs. Each table
and chair must be processed through 2 departments- assembly and finishing. Other relevant information are
shown below
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Departments Hours Required to Process 1 unit Hours available for
TABLE CHAIR the coming week

Assembly 2 4 24
Finishing 4 2 36

Profit / unit 6 8

Required: Using linear programming graphic method, determine how many tables and chairs should be
produced for the coming week that would maximize profit.
Steps in solving a linear programming graphical method problem

1. Set up the objective function and the constraints in mathematical format

(let X – number of tables; let Y = number of chairs )
Objective Function: Maximize Profit P6X + P8Y
Constraints: 2X + 4Y ≤ 24
4X + 2Y ≤ 36

2. Plot the constraints on a single graph (refer to slide 3)

2X + 4Y ≤ 24 (X=-0; Y= 6) and (X=12; Y=0)
4X + 2Y ≤ 36 (X= 0; Y= 18) and (X=9; Y =0)
Note: use the terminal points to plot the constraints
 Step 2: Plotting on a single graph
24

21

18

15

Area of feasible solution

12
B
9

6
D

0
2 4 6 8 10 12 14 16 18 20

A C
Con’t:
Step 3a. Identify the area of feasible solution . This is the area that does not violate any of the constraints
b. Identify the corners surrounding the area of feasible solution:
Point A (0, 0)
Point B (0, 6)
Point C (9,0)
Point D *intersection point of constraints 1 and 2)

(please refer to the graph in slide 3)

*computing for point D

a. Eliminate X
2( 2X + 4Y ≤ 24)
4X + 2Y ≤ 36
4X + 8Y = 48
4X + 2Y =36
6Y = 12
Y =2
b. Substitute to solve for Y
2X + 4Y = 24
2x + (4)(2) = 24
2X = 24 – 8
2X = 16
X = 8
Step 4: Determine the profit at each corner surrounding the feasible region using the profit equation:
P6X + P8Y

Point A (0, 0) = P6(0) + P8(0) = 0

Point B (0, 6) = 6(0) + 8(6) = 48
Point C (9, 0) = 6(9) + 8(0) = 54
Point D (2, 8) = 6(2) + 8(8) = 76

Decision rule: Pick the combination that yields the highest profit or lowest cost
Decision: The best combination of tables and chairs to produce for the coming
week is 2 tables and 8 chairs.
Assignment: Solve the problem, and submit your answers on November 5, 2021.

1. Solve using the Graphical method the following

problem:

3x + 2y
Maximize

subject to: 2x + y ≤ 18
2x + 3y ≤ 42
3x + y ≤ 24
 2. Information for the Wooden Tables and Chairs Linear Programming Problem. Find the optimum tables
and chairs to produce for the given period

Products Table(X) Chair(Y) Available

Resources

Wood(bf) 30 20 300

Labour(hr) 5 10 110

Profit / unit $6 $8
 Graphical illustration of Problem 1
24

20

D
16

B E Area of feasible solution

12

0 3 6 9 12 14 16 20 24
A

C
Corners surrounding the area of feasible solution
Objective: Maximize profit 3x + 2y
A (0 , 0) Php 0
B (0, 14) 28
C (0, 8) 24
D intersection pt of eq. 1& 2 ( 1.5, 15) 34.5
E intersection pt of 1 & 3 (6, 6) 30

Decision: produce 1.5 units of X and 15 units of Y