Scribd
Upload
3 views

Lecture 04 - Graphical Method

The document explains the graphical method for solving linear programming problems, focusing on cases with two variables. It outlines a five-step algorithm: formulating the LP problem, constructing a graph, determining valid sides of constraints, identifying the feasible solution region, and finding the optimum value. Examples are provided to illustrate the application of this method in maximizing an objective function subject to constraints.

Uploaded by

118 Sahiba Nawaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Lecture 04 - Graphical Method

The document explains the graphical method for solving linear programming problems, focusing on cases with two variables. It outlines a five-step algorithm: formulating the LP problem, constructing a graph, determining valid sides of constraints, identifying the feasible solution region, and finding the optimum value. Examples are provided to illustrate the application of this method in maximizing an objective function subject to constraints.

Uploaded by

118 Sahiba Nawaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

SOLVING LPP USING GRAPHICAL METHOD

TABLE OF CONTENTS

GRAPHICAL METHOD ..................................................................................................... 2

EXAMPLES ...................................................................................................................... 3

1|Page
GRAPHICAL METHOD
Owing to the importance of linear programming models in various fields of science, industry etc.,
many types of algorithms has been developed over the years to solve them. Some famous
mentions include the Simplex method, the Hungarian approach, and others. Here we are going to
concentrate on one of the most basic methods to handle a linear programming problem i.e. the
graphical method.

In principle, this method works for almost all different types of problems but gets more and more
difficult to solve when the number of decision variables and the constraints increase. Therefore,
we’ll illustrate it in a simple case i.e. for two variables only. So let’s get started with the graphical
method!

We will first discuss the steps of the algorithm:

Step 1: Formulate the LP (Linear programming) problem

We have already understood the mathematical formulation of an LP problem in previous lecture.


Note that this is the most crucial step as all the subsequent steps depend on our analysis here.

Step 2: Construct a graph and plot the constraint lines

The graph must be constructed in ‘n’ dimensions, where ‘n’ is the number of decision variables.
This should give you an idea about the complexity of this step if the number of decision variables
increases.

One must know that one cannot imagine more than 3-dimensions anyway! The constraint lines
can be constructed by joining the horizontal and vertical intercepts found from each constraint
equation.

Step 3: Determine the valid side of each constraint line

This is used to determine the domain of the available space, which can result in a feasible
solution. How to check? A simple method is to put the coordinates of the origin (0, 0) in
the problem and determine whether the objective function takes on a physical solution or not. If
yes, then the side of the constraint lines on which the origin lies is the valid side. Otherwise it lies
on the opposite one.

Step 4: Identify the feasible solution region

The feasible solution region on the graph is the one which is satisfied by all the constraints. It
could be viewed as the intersection of the valid regions of each constraint line as well. Choosing
any point in this area would result in a valid solution for our objective function.

2|Page
Step 5: Find the optimum value

An optimum value is found by finding an optimum point which always lies on one of the corners
of the feasible region.

 If the goal is to minimize the objective function, find the point of contact of the ruler with
the feasible region, which is the closest to the origin. This is the optimum point for
minimizing the function i:e, a minimum value of all corner point values
 If the goal is to maximize the objective function, find the point of contact of the ruler with
the feasible region, which is the farthest from the origin. This is the optimum point for
maximizing the function i:e, a maximum value of all corner point values

EXAMPLES
Example 1:

Maximize z = 18x + 16y

Subject to

15x + 25y≤ 375


24x + 11y≤ 264
x, y ≥ 0
Solution:
Step 1: Conversion of Inequality-constraints into equality constraints.

Step2: For Constraint 1

 If only x and no y is produced, the maximum value of x is 375/15 = 25. (25,0)


 If only y and no x is produced, the maximum value of y is 375/25 = 15. (0,15)

A line drawn between these two points (25, 0) & (0, 15), represents the constraint 15x + 25y ≤
375.

Step 3: For constraint 2

Similarly, the line for the second constraint 24x + 11y ≤ 264 can be drawn.

The polygon OABC represents the region of values for x & y that satisfy all the constraints. This
polygon is called the Feasible region / solution set.

The solution to this simple problem is exhibited graphically below.

3|Page
24
23 24𝑥 + 11𝑦 ≤ 264
22
21
20
19
18
17
16 A
15
14
O
13
B 15𝑥 + 2𝑦 ≤ 375
12
11
10
9
8
7
6
5
4
3
2
1 C
O 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

The end points (corner points) of the Feasible region are O = (0,0), A = (0,15), B= (5.7, 11.58) and
C = (11,0).

The values of the objective function at these points are 0, 240, 288, 198. Outof these four values,
288 is maximum.

The optimal solution is at the extreme / corner point B, where x = 5.7 &y = 11.58, and z = 288.

Example 2:

4|Page

You might also like