Module 3: Linear Programming: Graphical Method

Learning Outcomes

At the end of this module, you are expected to:

1. Formulate the objective function and the explicit constraints of the problem
2. Determine the feasible region using graphical method
3. Formulate the decisions of linear programming problems

3.1. Linear Programming

Linear Programming is used extensively today in many managerial applications. It is an

extremely powerful mathematical tool which can be used effectively to provide optimal solutions
to problems having thousands of variables and constraints. The graphical method is, however, is
restricted to, at most, three variables.

There are different constraints that is being considered in linear programming. Constraints
can be thought as scarce resources or other limitations. They can be men, machine, money, or time.
They can also be specifications, contractual limitations or policy restrictions. The set of constraints
in a linear programming problem constitutes a bounded region or a solution’s space. Within this
region the variables in the problem take on feasible values; in other words, a feasible solution is
one which does not violate any constraints. The optimum solution always lies at an extreme point
of the bounded region or at the intersection of two or more constraints.

In linear programming. The primary assumption involves linearity. First, the profit or cost
components must add up. In other words, if you make P10.00 producing one unit of a given
variable, then you make P20.00 if you produce two units, and P30.00 if you produce three units.
The input-output relationship is linear as well. For example, if you have a certain number f
constraining resources and can produce 20 units of output, then you must double each of the
resources if you want to realize 40 units, or double, the output. In effect, this means that our
problem must always assume constant returns to scale. Another assumption with linear
programming is that it is deterministic. This means that if we assign a given coefficient a certain
value, we assume with certainty that it is not only correct, but also does not change over time and
it does not change with a different mix of the solution variables. This, of course, applies to
coefficient in the objective function, such as peso per unit contribution, or coefficients in the
constraints, such as hours of inactive time per unit of output.

3.2. Formulation of a Linear Program

In formulating linear programs, it is very important to gather valid information regarding

the appropriate constraints to be used in linear problems. Once all information about the objective
functions and the explicit constraints have been identified you are now ready to assemble a model.

Management Science: Module 3 Page 1 of 9

 1. Identify the decision variables (e.g., types of products) and assign their
corresponding variable (x and y)

2. Determine the objective of the problem to formulate the objective function (e.g.,
maximize profit or minimize cost)

3. Write the objectives in terms of the decision variables (e.g., minimize 2x +5y)

4. Determine the constraints (e.g., the hours a machine is available per week, say 25
hours. then the hours spent in making product x is 3 and 2 hours for product y)

5. Write the constraints in terms of the decision variables (e.g., hours spent: 3x + 2y
≤ 25 hours)

6. Include the implicit constraints. This means that only the positive values of x and y
will be used since there are no negative number of hours, negative number of
workers, etc. this will also limit your graph in the 1st quadrant where the values of
x and y are positive. (e.g., x ≥ 0 and y ≥ 0)

Let us have this example:

A firm manufactures 2 products, A and B. Each product is processed by 2 machines,

Machine 1 and Machine 2. Each unit of type A requires 1 hour of processing by Machine 1, and 2
hours in Machine 2. On the other hand, each unit of type B requires 1 hour in Machine 1, and 1
hour in Machine 2. The profit on product A is P20.00 per unit and on product B is P30.00 per unit.
If Machine 1 is available for 200 hours each month and Machine 2 for 300 hours, how many units
of each type can be manufactured in one month in order to maximize profits?

Answer:

• Assign variable to product A and product B:

Let product A be “x”

Let product B be “y”

• Determine the objective: Maximize profits

Each product A give P20.00 profit

Each product B gives P30.00 profit

Therefore, our objective function will be: 𝑴𝒂𝒙𝒊𝒎𝒊𝒛𝒆 𝑷 = 𝟐𝟎𝒙 + 𝟑𝟎𝒚

• Determine the constraints:

Each product A requires: 1 hour in Machine 1

2 hours in Machine 2

Management Science: Module 3 Page 2 of 9

 Each product B requires: 1 hour in Machine 1
1 hour in Machine 2

Availability of Machine 1: 200 hours/month

Availability of Machine 2: 300 hours/month

Therefore, our constraints will be:

Machine 1: 𝒙 + 𝒚 ≤ 𝟐𝟎𝟎 𝒉𝒐𝒖𝒓𝒔

Machine 2: 𝟐𝒙 + 𝒚 ≤ 𝟑𝟎𝟎 𝒉𝒐𝒖𝒓𝒔

The complete mathematical model for our problem will be:

𝑴𝒂𝒙𝒊𝒎𝒊𝒛𝒆 𝑷 = 𝟐𝟎𝒙 + 𝟑𝟎𝒚

Subject to:
Machine 1: 𝒙 + 𝒚 ≤ 𝟐𝟎𝟎 𝒉𝒐𝒖𝒓𝒔
Machine 2: 𝟐𝒙 + 𝒚 ≤ 𝟑𝟎𝟎 𝒉𝒐𝒖𝒓𝒔
𝒙≥𝟎
𝒚≥𝟎

3.3. Linear Programming: Graphical Method

Linear programming is a technique used to make decisions that will maximize or minimize
quantity know as the objective function. This is a linear equation made up of decision variables.
By changing the value of the decision variable, the value of the objective function will also change.
The objective of linear programming graphical method is to choose values of two decision
variables x and y that will maximize the profit or minimize the cost of operation or production of
the company as the case may be depending on the problem to be solved. The decision variables
are subject to various explicit constraints. These constraints impose limits on the values of the
decision variables and often represent the availability of resources.

3.4. Solving LP using Graphical Method

Using the example above, let us solve the problem using graphical method.

𝑴𝒂𝒙𝒊𝒎𝒊𝒛𝒆 𝑷 = 𝟐𝟎𝒙 + 𝟑𝟎𝒚

Subject to:
Machine 1: 𝒙 + 𝒚 ≤ 𝟐𝟎𝟎 𝒉𝒐𝒖𝒓𝒔
Machine 2: 𝟐𝒙 + 𝒚 ≤ 𝟑𝟎𝟎 𝒉𝒐𝒖𝒓𝒔
𝒙≥𝟎
𝒚≥𝟎

Management Science: Module 3 Page 3 of 9

Let us solve for our constraint then graph.

Machine 1: 𝑥 + 𝑦 ≤ 200 ℎ𝑜𝑢𝑟𝑠

𝑥 + 𝑦 = 200 ℎ𝑜𝑢𝑟𝑠

If x = 0, y = 200 (0, 200)

If y = 0, x = 200 (200, 0)

Machine 2: 2𝑥 + 𝑦 ≤ 300 ℎ𝑜𝑢𝑟𝑠

2𝑥 + 𝑦 = 300 ℎ𝑜𝑢𝑟𝑠

If x = 0, y = 300 (0, 300)

If y = 0, x = 150 (150, 0)

Let us graph the 2 equations:

Combining the 2 graphs:

Management Science: Module 3 Page 4 of 9

Let us now determine the vertices (point of intersection in our graph)

A Vertex Coordinates
A (0, 200)
B (100, 100)
B C (150, 0)
D (0, 0)

D C

Note: point B is solved algebraically using elimination by subtraction

𝑥 + 𝑦 = 200
−
2𝑥 + 𝑦 = 300 Substitute the x= 100 to either equation 1 or equation
−𝑥 = −100 2, you will arrive at the answer 𝒚 = 𝟏𝟎𝟎
𝒙 = 𝟏𝟎𝟎

We will now compute for the profit in each vertex using our objective function.

Vertex Coordinates 𝑷 = 𝟐𝟎𝒙 + 𝟑𝟎𝒚 Profit

A (0, 200) 𝟐𝟎(𝟎) + 𝟑𝟎(𝟐𝟎𝟎) 6, 000
B (100, 100) 𝟐𝟎(𝟏𝟎𝟎) + 𝟑𝟎(𝟏𝟎𝟎) 5, 000
C (150, 0) 𝟐𝟎(𝟏𝟓𝟎) + 𝟑𝟎(𝟎) 3, 000
D (0, 0) 𝟐𝟎(𝟎) + 𝟑𝟎(𝟎) 0

Formulate a decision.

Since the highest profit is 6, 000, therefore, we will only produce product B.

𝟑𝟎𝒚 = 𝟔, 𝟎𝟎𝟎

Management Science: Module 3 Page 5 of 9

Let us have another example:

An appliance manufacturer produces two models of electric fan: stand fans and desk fans.
Both models require fabrication and assembly work. Each stand fan uses 4 hours of fabrication
and 2 hours assembly. The desk fan, on the other hand, requires 2 hours fabrication and 6 hours
assembly. There are 600 fabrication hours available per week and 480 hours of assembly. Each
stand fan contributes P400 to profits and each desk fan contributes P300 to profits. How many
stand fans and desk fans must the manufacturer produce in order to maximize profit?

Solution:

Product Variable Fabrication Hours Assembly Hours Profit

Stand fan x 4 2 P400
Desk fan y 2 6 P300
Available hours 600 480

Objective function: 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑃 = 400𝑥 + 300𝑦

Constraints: Fabrication time: 4𝑥 + 2𝑦 ≤ 600

Assembly time: 2𝑥 + 6𝑦 ≤ 480
Implicit constraints: 𝑥, 𝑦 ≥ 0

Therefore, our mathematical model for this problem will be:

𝑴𝒂𝒙𝒊𝒎𝒊𝒛𝒆 𝑷 = 𝟒𝟎𝟎𝒙 + 𝟑𝟎𝟎𝒚

Subject to: 𝟒𝒙 + 𝟐𝒚 ≤ 𝟔𝟎𝟎

𝟐𝒙 + 𝟔𝒚 ≤ 𝟒𝟖𝟎
𝒙, 𝒚 ≥ 𝟎
Let us solve for our constraint then graph.

Fabrication: 4𝑥 + 2𝑦 ≤ 600 ℎ𝑜𝑢𝑟𝑠

4𝑥 + 2𝑦 = 600 ℎ𝑜𝑢𝑟𝑠

If x = 0, y = 300 (0, 300)

If y = 0, x = 150 (150, 0)

Assembly: 2𝑥 + 6𝑦 ≤ 480 ℎ𝑜𝑢𝑟𝑠

2𝑥 + 6𝑦 = 480 ℎ𝑜𝑢𝑟𝑠

If x = 0, y = 80 (0, 80)
If y = 0, x = 240 (240, 0)

Management Science: Module 3 Page 6 of 9

Graph of the 2 equations:

Combining the 2 graphs will result to this:

Let us now determine the vertices (point of intersection in our graph)

Vertex Coordinates
A (0, 80)
B (132, 36)
C (150, 0)
A
D (0, 0)
B
D
C

Management Science: Module 3 Page 7 of 9

Solving for point B algebraically using elimination by subtraction we will get:

4𝑥 + 2𝑦 = 600
−
2𝑥 + 6𝑦 = 480 Multiply equation 1 with 3 so we can eliminate y

12𝑥 + 6𝑦 = 1800
−
2𝑥 + 6𝑦 = 480 Substitute the x= 132 to either equation 1 or equation
10𝑥 = 1320 2, you will arrive at the answer 𝒚 = 𝟑𝟔
𝒙 = 𝟏𝟑𝟐

We will now compute for the profit in each vertex using our objective function.

Vertex Coordinates 𝑷 = 𝟒𝟎𝟎𝒙 + 𝟑𝟎𝟎𝒚 Profit

A (0, 90) 𝟒𝟎𝟎(𝟎) + 𝟑𝟎𝟎(𝟖𝟎) 24, 000
B (132, 36) 𝟒𝟎𝟎(𝟏𝟑𝟐) + 𝟑𝟎𝟎(𝟑𝟔) 63, 600
C (150, 0) 𝟒𝟎𝟎(𝟏𝟓𝟎) + 𝟑𝟎𝟎(𝟎) 60, 000
D (0, 0) 𝟒𝟎𝟎(𝟎) + 𝟑𝟎𝟎(𝟎) 0

Formulate a decision.

Since the highest profit is 63, 600, therefore, we will produce 132 of the stand fans and 36
of the desk fans.

𝟏𝟑𝟐𝒙 + 𝟑𝟔𝒚 = 𝟔𝟑, 𝟔𝟎𝟎

Management Science: Module 3 Page 8 of 9

Management Science: Module 3 Page 9 of 9