Operations Research

LECTURE 4
Graphical Method of
Linear Programming

1
Graphical method in linear programming
The graphical method is a fundamental
technique used in linear programming to
visually analyze and solve optimization
problems with linear constraints. It provides a
geometric approach to finding the optimal
solution for problems involving resource
allocation, production planning, and other
decision-making scenarios where limited
resources must be allocated among
competing alternatives to maximize or
minimize an objective function.

The key components of the Graphical Method include

1. Decision Variables: These represent the quantities or values that must be determined to
optimize the objective function. In a linear programming problem, decision variables are
typically represented as coordinates on a graph.

2. Objective Function: This is a mathematical expression that needs to be either maximized

(finding the highest point) or minimized (finding the lowest point). The objective function is
typically represented as a straight line on the graph.

3. Constraints: These are the limitations or restrictions that define the feasible region within
which the optimal solution must lie. Constraints are represented as inequalities on the graph

Steps to solve linear programming through graphical method

The steps involved in using the graphical method to solve a linear programming problem are as
follows:

1. Formulate the Problem: Write down the objective function to be maximized or minimized, along
with the linear inequalities representing the constraints.

2. Graph the Constraints: Plot each constraint on a graph, typically using two dimensions (for two
variables). The feasible region is the area where all regulations intersect and overlap.

3. Identify Vertices: Locate the vertices (corners) of the feasible region. These vertices are the
possible solutions for the linear programming problem.

4. Calculate Objective Function Values: Calculate the value of the objective function at each
vertex.

5. Determine Optimal Solution: Compare the objective function values at the vertices and identify
the vertex that yields the optimal value of the objective function (either maximum or minimum,
depending on the problem).

2
6. Interpret the Solution: Translate the optimal solution back into the context of the original
problem to make practical decisions.

Note: The Graphical Method is most effective for problems with only two decision variables, as it
can be graphed on a two-dimensional plane. For problems with more than two variables, other
techniques such as the Simplex method or interior-point methods are typically used.

While the Graphical method provides a visual and intuitive approach to solving linear programming
problems, it has limitations, such as its inability to handle problems with a large number of variables
or constraints. In such cases, more efficient algorithmic methods are preferred.

Following is the portrayal of the Cartesian plane.

Cartesian Plane
A Cartesian plane, also known as a coordinate
plane or Cartesian coordinate system, is a
two-dimensional geometric system that
allows points to be located using numerical
coordinates. It serves as a fundamental tool in
mathematics and is used to graphically
represent and analyze various mathematical
relationships, equations, and functions.

The Cartesian plane is divided into four quadrants:

§ First Quadrant (I): Points with positive x-coordinates and positive y-coordinates.
§ Second Quadrant (II): Points with negative x-coordinates and positive y-coordinates.
§ Third Quadrant (III): Points with negative x-coordinates and negative y-coordinates.
§ Fourth Quadrant (IV): Points with positive x-coordinates and negative y-coordinates.

Steps to plot the equations on graph

1. Consider each inequality constraint as an equation.
2. Plot each equation on the graph as each will geometrically represent a straight line.
3. Plot the feasible region, every point on the line will satisfy the equation on the line.
4. If the inequality constraint corresponding to that line is less than or equal to, then the region
below the line lying in the 1st quadrant (as shown in the above graph) is shaded (due to non-
negativity of variables); for the inequality constraint with greater than or equal to sign, the
region above the line in the 1st quadrant is shaded. The points lying in a common region will
satisfy all the constraints simultaneously. Hence, it is called a feasible region.
5. Identify the coordinates of the corner points.
6. Find the ‘Z’ value by substituting the coordinates of corner points to the objective functions.

3
Numerical Example
Question 1:
Maximize Z= 3x1 +5x2 (Subject to constraints)

Solution:
Step 1: Convert the inequalities into equalities and find the divisible of the equalities.

Equation x1 x2

x1+2x2=2000 2000 1000

x1+x2=1500 1500 1500

x2=600 - 0

Step 2:
Fix up the graphic scale.
Maximum points = 2000
Minimum points = 600
2 cms = 500 points

Step 3:
Graph the data

Step 4: Find the coordinates of the corner points

CornerPoints x1 x2

O 0 0

A 1500 0

B 1000 500

C 800 600

D 0 600

4
Put x2 = 500 in eq. (1),

Therefore x1 = 800

Step 5:
Substitute the coordinates of corner points into the objective function.
Maximize ‘Z’ = 3x1 + 5x2
At ‘O’, Z = 0+0=0
At ‘A’, Z = 3 (1,500) + 5 (0) = 4500
At ‘B’, Z = 3 (1,000) + 5 (500) = 5500
At ‘C’, Z = 3 (800) + 5 (600) = 5400
At ‘C’, Z = 3 (0) + 5 (600) = 3000

Question 2:
Use the graphical method to solve the following LP problem.
Maximize 'Z'= 2x1 +x2
(Subject to constraints)

5
Solution
Plot on a graph each constraint by first treating it as a linear equation. Then use the inequality
condition of each constraint to mark the feasible region by the shaded area.

Graphical Solution of LP Problem Feasible

region is the overlapping area of constraints
that satisfies all of the constraints on
resources. Table Set of Feasible Solutions that
we have not considered the area below the
lines x1-x2=2 and x1-2x2 <=1 for the negative
values of x2. This is because of the non-
negativity condition, x2>= 0
The coordinates of extreme points of the
feasible region are: O = (0, 0), A = (1, 0), B = (3,
1), C = (4, 2), D = (2, 4), and E = (0, 5). The value
of the objective function at each of these
extreme points is shown in Table.

Extreme Point Coordinates, Objective Function Value

(x1,x2) Z'= 2x1 +x2

O (0,0) 2(0)+0 = 0

A (1,0) 2(1) + 0=2

B (3,1) 2(3) + 1 = 7

C (4,2) 2(4) + 2 = 10

D (2,4) 2(2) + 4 = 8

E (0,5) 2(0) + 5 =5

The maximum value of the objective function Z = 10 occurs at the extreme point (4, 2). Hence, the
optimal solution to the given LP problem is x1 = 4, x2 = 2, and Max Z = 10.

Alternative (or Multiple) Optimal Solutions

We have seen that the optimal solution of any linear programming problem occurs at an extreme
point of the feasible region and that the solution is unique, i.e. no other solution yields the same
value of the objective function. However, in certain cases, a given LP problem may have more than
one solution yielding the same optimal objective function value. Each of such optimal solutions is
termed an alternative optimal solution.
a) There are two conditions that should be satisfied for an alternative optimal solution to exist:
The slope of the objective function should be the same as that of the constraint forming the
boundary of the feasible solutions region
b) The constraint should form a boundary on the feasible region in the direction of optimal
movement of the objective function.

6
In other words, the constraint should be an active constraint. The constraint is said to be active
(binding or tight), if, at the point of optimality, the left-hand side of a constraint equals the right-
hand side. In other words, an equality constraint is always active, and an inequality constraint may
or may not be active.

Geometrically, an active constraint is one that passes through one of the extreme points of the
feasible solution space

Question1:
Use the graphical method to solve the following LP problem

Maximize Z = 10x1 + 6x2 subject to the constraints

Solution:
The constraints are plotted on a graph by first
treating these as equations and then their
inequality signs are used to identify the
feasible region (shaded area) as shown in Fig.
The extreme points of the region are
O, A, B, and C.

Since the objective function (iso-profit line) is parallel to the line BC (first constraint: 5x1 + 3x2 =
30,), which also falls on the boundary of the feasible region. Thus, as the iso-profit line moves away
from the origin, it coincides with the line BC of the constraint equation line that falls on the
boundary of the feasible region. This implies that an optimal solution of the LP problem can be
obtained at any point between B and C including extreme points B and C on the same line.
Therefore, several combinations of values of x1 and x2 give the same value of the objective
function. The value of variables x1 and x2 obtained at extreme points B and C should only be
considered to establish that the solution to an LP problem will always lie at an extreme point of the
feasible region. The value of the objective function at each of the extreme points is shown in Table

Extreme Point Coordinates, Objective Function Value

(x1,x2) Z = 10x1 + 6x2

O (0,0) 10(0)+6(0) = 0

A (0,9) 10(0) + 6(9)=63

B (6/7,60/7) 10(6/7) + 6(60/7) = 54

C (6,7) 10(6) + 6(7) = 60

7
Since value (maximum) of objective function, Z = 60 at two different extreme points B and C is same,
therefore two alternative solutions exist x1 = 6/7, x2 = 60/7 and x2= 6, x2 = 0.

Infeasible Solution
An infeasible solution to an LP problem arises when there is no solution that satisfies all the
constraints simultaneously. This happens when there is no unique (single) feasible region. This
situation arises when an LP model has conflicting constraints. Any point lying outside the feasible
region violates one or more of the given constraints.

Use the graphical method to solve the following LP problem:

Maximize Z = 6x1 – 4x2
subject to the constraints

The constraints are plotted on graph as usual

as shown in Fig. Since there is no unique
feasible solution space, therefore a unique set
of values of variables x1 and x2 that satisfies
all the constraints cannot be determined.
Hence, there is no feasible solution to this LP
problem because of the conflicting
constraints

Limitations of Graphical Method

The graphical method is a useful technique for solving Linear Programming Problems (LPP),
especially in two dimensions. However, it has several limitations, particularly when dealing with
complex or higher-dimensional problems. Here are five limitations of the graphical method:

1. Limited to Two Dimensions: The graphical method is primarily applicable to problems with only
two decision variables, as it becomes impractical to visualize and represent the feasible region
graphically in higher dimensions.

2. Infeasibility and Unboundedness: In some cases, the feasible region may be empty (infeasible)
or unbounded, making it challenging to accurately interpret the solution graphically.

8
3. Precision and Accuracy: The graphical method relies on manual plotting and reading of points,
which can lead to errors and reduced accuracy, especially when dealing with fine adjustments or
small changes in the objective function.

4. Complex Constraints: When constraints are nonlinear or have complex shapes, accurately
representing them graphically can be difficult or impossible, limiting the method's applicability.

5. Non-Integer Solutions: The graphical method may not handle problems with integer or binary
solution requirements efficiently, as it does not directly address discrete decision variables.

While the graphical method is a valuable tool for introducing the concepts of Linear Programming
and providing insights into simple problems, its limitations become more apparent in more
intricate and multidimensional scenarios. In such cases, more advanced techniques such as the
Simplex algorithm or interior point methods are often preferred for accurate and efficient
solutions.

References:

§ Hillier, F. S., & Lieberman, G. J. (2013). Introduction to operations research. New York, NY: McGraw-Hill.
§ Winston, W. L. (2014). Operations research: Applications and algorithms. Boston, MA: Cengage Learning.
§ Taha, H. A. (2016). Operations research: An introduction. Upper Saddle River, NJ: Pearson.