Linear Programming:

Graphical Method
Catherine U. Malig, MBA
Ref: Winston S.Sirug
• Linear Programming is a method of dealing with
decision problems that can be expressed as
constrained linear models.

• It is a mathematical technique for finding the best uses

of an organization’s resources.

• Developed by George Dantzig in 1940s.

• LP was developed by George Dantzig, an American
mathematical scientist (1914-2005).

• Theory of Linear Programming states that the optimal

solution will lie at a corner point of the feasible region.

• Graphical Solution Method is a two dimensional geometric

analysis of LP problems with two decision variables.
Linear Programming Problems

• Maximum P=a1X+b1Y
• Minimum C=A1x+b1Y
Subject to constraints
a2X+b2Y≤c or a2X+b2Y≥c or a2X+b2Y=c
TERMINOLOGIES

• Objective Function is an expression which shows the

relationship between the variables and the firm’s
goal. This can be maximization of profit or
minimization of cost.

• Structural Constraints or Explicit Constraint is a

limit on the availability of resources.
TERMINOLOGIES

• Non-negativity Constraints or Implicit Constraint is

a constraint that restricts all the variables to zero and
positive solution.

• Optimal Value- the highest (for maximization

problem) and lowest ( for minimization problem)
 TERMINOLOGIES

• Optimal Solution is a combination of decision variable amounts that

yields the best possible value of the objective function and satisfies
all the constraints.

• Feasible Region this is the allowable decision that satisfies the non
negativity conditions of all the constraints.

• Extreme point the optimal solution are at the extreme points of the
feasible region.
 TERMINOLOGIES

Feasible Region –is a set of combinations of

values for the decision variables that satisfy
the non-negativity conditions and all the
constraints simultaneously that is the
allowable decision
Extreme Point-is the corner of the feasible
region; it is the location of the maximum and
minimum point of the feasible region.
 Fundamental Theorem of Linear Programming
Problem

• If a LP problem has optimal solution, there is always at least

one extreme point (corner point) solution of the feasible region.

• A LP problem with bounded, nonempty feasible regions always

contain optimal solution
Problem

A local boutique produce two designs of gowns A and B and

has the following material available: 18 square meters of
cotton, 20 square meters of silk and 5 square meters of wool.
Design A requires the following: 3 Sqm of cotton,2 Sqm of
silk and 1 sqm of wool. Design B requires 2 sqm of cotton, 4
sqm of silk. If design A sells for P1,200 and design B for
P1,600, how many garments should the boutique produce to
obtain the maximum amount of a money.
Steps in solving LP-Maximization Problem
• Step 1. Represent the unknown in the problem.
• Step 2. Tabulate the data about the facts (if necessary)
• Step 3. Formulate the objective function and constraints by restating the information in
mathematical form.
• Step 4. Plot the constraints of the LP on a graph.
• Step 5. After identifying the feasible region of the LP problem, we need to trace the extreme
points and solve for the unknown coordinates.
• Step 6. Solve for the intersection of the lines which satisfies the feasible solution
simultaneously, using any of the four mathematical technique. Elimination, Substitution,
Equivalent or Cramer’s.
• Step 7. Substitute the coordinates at the extreme points on the feasible region to the objective
function.
• Step 8. Formulate the decision
Step 1. Represent the unknown in the problem.

• Let X be the number of Design A gowns

• Let Y be the number of Design B gowns

Step 2. Tabulate the data about the facts (if necessary)

Materials Design A (X) Design B (Y) Available

Cotton 3 2 18
Silk 2 4 20
Wool 1 0 5
Profit P1,200 P1,600
 Step 3. Formulate the objective function and constraints
by restating the information in mathematical form.

The objective function is Maximize: P=a1X+b1Y

P=1200x+1600y
The Constraints are: 1. 3x+2y≤18
2.2x+4y≤20 Structural Constraints
3. x ≤5
4. x≥0, y≥0 Non-negativity Constraints
Step 4. Plot the constraints of the LP on a graph
3x+2y=18 2x+4y=20 X=5
Let x=0 Let x=0
3(0)+2y=18 2(0)+4y=20 (5,0)
0+2y=18 0+4y=20
2y=18 4y=20
Y=9 (0,9) Y=5 (0,5)

Let y=0 Let y=0

3x+2(0)=18 2x+4(0)=20
3x+0=18 2x+0=20
3x=18 2x=20
X=6 (6.0) X=10 (10,0)
 Step 5. After identifying the feasible region of the LP
problem, we need to trace the extreme points and solve for
the unknown coordinates
Step 6. Solve for the intersection of the lines which satisfies the feasible
solution simultaneously, using any of the four mathematical technique.
Elimination, Substitution, Equivalent or Cramer’s.
First Equation:3x+2y=18 First Equation:3x+2y=18
Second Equation: 2x+4y=20 Third Equation: x=5

2(3x+2y=18) 6x+2y=36 3(5)+2y=18

3(2x+4y=20) - 6x+12y=60 15+2y=18
0x-8y=-24 2y=18-15
-8y=-24 2y=3
Y=1.5
y=3
(5,1.5) The intersection of 1st and 3rd
equation
3x+2(3)=18
3x+6=18
3x=18-6
3x=12
X=4 (4,3) the intersection of the
1st and 2nd equation
Step 7. Substitute the coordinates at the extreme points on
the feasible region to the objective function.
Objective function: P=1200x+1600y

Extreme Values of the objective function

Points
(0,5) 1200(0)+1600(5)=0+8000=8000
(5,0) 1200(5)+1600(0)=6000+0=6000
(4,3) 1200(4)+1600(3)=4800+4800=9600
(5,1.5) 1200(5)+1600(1.5)=6000+2400=8400
Step 8. Formulate the decision
Since (4,3) gives the highest value pf P9600, the decision now will be to produce 4
Design A gowns and 3 Design B gowns in order to maximize the sales. This will now be
the optimal solution.

To check: Substitute the values of X & Y in all the constraints.

3x+2y≤18 2x+4y ≤20 x≤5
3(4)+2(3) ≤18 2(4)+4(3) ≤20 4≤5
12+6≤18 8+12≤20
18≤18 20≤20
 Exercises on Maximization
A souvenir store wishes to produce two models of
souvenirs: Model A and Model B. Every model-A will result
to P14 profit, and every model B will result to P23 profit.
To manufacture a model-A requires 3 minutes in Stage 1
and 6 minutes in Stage 2. Model-B requires 5 minutes on
stage 1 and 4 minutes on stage 2. There are 270 minutes
on stage 1 and 360 minutes on stage 2 for processing
order. How many souvenirs or each model should the
store make in order to maximize profit.
 Solving Linear Equation: Minimization Problem
A pharmacist produces a drug from two ingredients. Each ingredient contains
the same antibiotics in different proportions. Each ingredient A produced
results P80 in cost; ingredient B results P50 in cost. The production of the
antibiotics is dependent on the availability of limited resources. The resource
requirements are as follows: The company wants to determine the quantity of
ingredient A &B that must go in to the drug in order to meet the antibiotics
minimum requirements at the minimum cost.
Resources Requirement
Antibiotic Ingredient A Ingredient B Minimum
Requirement
1 3 units 1 unit 6
2 1 unit 1 unit 4
3 2 units 6 units 12
Cost P80 P50
Step1: Let X be the quantity of Ingredient A
Let Y be the quantity of Ingredient B
Step2: Tabulate
Materials Ing. A (X) Ing. B(Y) Requirement
Antibiotics 1 3 1 6
Antibiotics 2 1 1 4
Antibiotics 3 2 6 12
Cost P80 P50
Step 3:Objective Function is to minimize the cost C=80X+50Y
Constraints are: 3x+y≥6
x+y≥4
2x+6y≥12
x≥0,y≥0
 3x+y≥6 x+y≥4 2x+6y≥12
3x+y=6 x+y=4 2x+6y=12
Let x= 0 Let x=0 Letx=0
3(0)+y=6 0+y=4 2(0)+6y=12
Y=6 (0,6) Y=4 (0,4) 6y=12
Y=2 (0,2)
Let Y=0 Let Y=0 Let y=0
3x+0=6 X+0=4 2x+6(0)=12
3x=6 X=4 (4,0) 2x=12
X=2 (2,0) X=6 (6,0)
Step4: Plot the constraints on the graph
STEP 5: Identify the feasible region
STEP 6:Solve for the intersection line of 1st and
2nd equation

1st & 2nd equation 2nd & 3rd equation

3x+y=6 x+y=4
x+y=4 2x+6y=12
(1,3) (3,1)
 Step 7: Substitute the coordinates at the extreme
points of the feasible region in the objective function.
 Obj. Function: C=80X+50Y

Extreme Points Values of the objective functions

(0,6) 80(0)+50(6)=0+300=300
(6,0) 80(6)+50(0)=480+0=480
(1,3) 80(1)+50(3)=80+150=230
(3,1) 80(3)+50(1)=240+50=290
 Step 8: Formulate Decision

• Since the coordinate is (1,3) will give you the

lowest value of P230. The decision is to mix 1 unit
of ing.A and 3 units of Ing. B in order to minimize
cost.
Different LP problems

1. Maximization Involving Mixed Constraints-

the structural constraints involves with =,≤ and
≥for both maximization and minimization.
Exercises
• An appliance manufacturer produces two models of televisions
:Smart TV and LED TV. Both models requires fabrication and
assembly work; each Smart TV uses 4 hours of fabrication and 2
hours of assembly, each LED TV uses 2 hours of fabrications and 6
hours of assembly. There are 560 fabrication hours available per
week and 480 hours of assembly. Each Smart TV contributes
P6,000 to profits and each LED TV contributes P4,500 to profits.
How many Smart TV and LED TV must the manufacturer produce
in order to maximize the profit.
Answer
Step 1. Let x be the number of Smart TV to be produce
Let y be the number of LED TV to be produce
Step. 2 Tabulate the facts:
Hours Smart TV (X) LED TV(Y) Available Hours
Fabrications 4 2 560
Assembly 2 6 480
Profit P6,000 P4,500
Step 3: Objective Function P=6000x+4500y
Constraints: 4x+2y≤560 4x+2y≤560
4x+2y=560
2x+6y≤480 Let x=0 4(0)+2y=560 Let y=0
2y=560 4x+2(0)=560
x≥0, y≥0
Y=280 4x=560
(0,280) X=140
(140,0)
Step 4: Plot the constraints: 2x+6y≤480
2x+6y=480
Let x=0 2(0)+6y=480 Let y=0
6y=480 2x+6y=480
Y=80 2x=480
(0,80) X=240
(240,0)
Step 5.Trace the extreme points and solve for the
unknown coordinates.
Step 6: Solve for the intersection which satisfies the
feasible solution.
1
4x+2y=560
2x+6y=480
4x+2(40)=560
2
4x+80=560
4x+2y=560 4x=560-80
4x+12y=960
4x=480
=-Y10=-400
y=40 x=120
 • Step 7: Extreme Points:

Extreme Values of the

Points Objective Function
(0,80) 6000(0)+4500(80) P360,000
(140,0) 6000(140)+4500(0) P840,000
(120,40) 6000(120)+4500(40) P900,000 Optimal Value and
Optimal Solution
 Step 8: Decision Making

•Since (120,40) has the optimal value of P

900,000 and the optimal solution, the
company should manufacture 120 pcs of
Smart Tvs and 40 pcs LED TV to maximize
the profit.
• A factory manufactures two products each requiring
the use of three machines. The machine A can be
used at most 70 hours; the machine B at most 50
hours; and machine C at most 90 hours. The first
product requires 2 hours on machine A, 4 hours on
machine B, and 4 hours on machine C. If the profit is
P5700 per unit for the first product and P6200 unit for
the second product, how many units each product
should be manufactured to maximize profit.