

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
How to find the optimal solution of a linear programming problem using the graphical method. It involves finding the iso-profit lines and drawing parallel lines to determine the maximum or minimum value of the objective function. Examples of minimizing and maximizing the objective function with given constraints.
Typology: Lecture notes
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Alternate Method:
Instead of evaluating the objective function at all the extreme points; a graphical optimum solution can be obtained which is explained below.
Consider the objective function
Z = 4 x + 7 y
Assign a convenient arbitrary value for Z say Z = 140, then
Z = 4 x + 7 y = 140
This is a straight line, which can be represented in the solution space as shown in figure 11.
Consider Z = 4 x + 7 y = 140. If x = 0, we get y = 20 and if y = 0, we get x = 35. These two points are connected by a straight line representing Z = 140.
Thus Z = 140 is called an iso-profit line since for all points in the straight line, Z = 140. With this value we have obtained the slope and hence shape of the straight line.
Next step is to draw straight lines parallel to 4 x + 7 y = 140.
This results in moving the objective line with various values in the solution space in a proper direction (upwards in this example for maximization and downwards for minimization). In this process, the objective line may cross a corner point indicating the maximum or minimum value.
Drawing parallel lines we see that a line passing through C (30, 30) gives the maximum value for Z and value of Z* = 330.
Example
Minimize Z = 4 x + 5 y
Subject to x + y > 10 2 x + 5 y > 35 x, y > 0 Solution
STEP 1 Represent the constraints graphically
Consider x + y = 10 If x = 0, then y = 10 If y = 0, then x = 10
Consider 2 x + 5 y = 35 If x = 0, then y = 7
If y = 0, then x = 17.
The above constraints are represented in figure 12.
STEP 2 : Mark the solution space in the graph satisfying all the constraints.
Fig. 12
STEP 3: Choose an arbitrary value of Z , say 100. Then
Z = 4 x + 5 y = 100 If x = 0, then y = 20 If y = 0, then x = 25
Represent Z = 100 in the graph.
Move down the line Z = 100 to minimize the total cost Z. Thus we get the minimum value of Z at the point B , which is the intersection of two lines:
x + y = 10 2 x + 5 y = 35
Solving the two equations, we get x = 5, y = 5
RESULT: The minimum value of Z = 4 x 5 + 5 x 5 = 45, Therefore, Z* = 45, x = 5, y = 5