Scribd
Upload
2 views

3. Graphical Method

The document explains the graphical method for solving simple linear programming problems with two decision variables. It outlines the steps for determining the feasible solution space and finding the optimum solution by analyzing corner points. Additionally, it discusses special cases such as unique, infinite, unbounded, and no solutions.

Uploaded by

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

3. Graphical Method

The document explains the graphical method for solving simple linear programming problems with two decision variables. It outlines the steps for determining the feasible solution space and finding the optimum solution by analyzing corner points. Additionally, it discusses special cases such as unique, infinite, unbounded, and no solutions.

Uploaded by

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

Graphical Method

GRAPH IN SIGHT, ANSWER IN MIND


Introduction
 Simple linear problems with two decision variables can be
solved easily using graphical method.
 One of them will be in X-axis, the other will be in y-axis

 Two steps –
 Determination of feasible solution space
 Determination of the optimum solution from all the feasible points in
the solution space
Determining Feasible Solution Space
 Consider each inequality constraints as equations and plot the
respective straight lines in the graph.
 Each of these lines divide the graph plane in two parts, one on
each side of the line.
 Only one of these two parts satisfies the respective inequality.
 To determine the correct side, choose (0, 0) as reference point.
 If it satisfies the inequality, then the side of the line where the
reference point belongs, represents the feasible part against that
inequality.
 If it does not satisfy, then the feasible part is on the opposite side
of the line. [use GeoGebra too illustrate]
 Non-negativity constraints restricts the solutions space area
within first quadrant.
Determining Feasible Solution Space
 The area that in the graph that simultaneously satisfies all the
constraints is the feasible solution space.
 Model of Product Mix Problem
was :-

Maximize Z = 6.X + 5.Y


subject to, X + Y ≤ 5
3.X + 2.Y ≤ 12
A
X, Y ≥ 0
B
 The area ABCD denotes the
feasible solution space in this
example.

D C
Determining Optimum Solution
 The feasible solution space contains infinite number of solution
points.
 To find the optimal point draw the line corresponding to the
objective function.
 Move the line by increasing / decreasing the values of decision
variables of the objective function.
 Note the optimum value of the objective function when some
part of the line is within the feasible solution space including the
boundary lines.
 Illustrate using Tora.
Determining Optimum Solution Manually
 Due to convex nature of the feasible region, the optimum
solution point is always associated with a corner point of
the solution space.
 So, determine the coordinates of the corner points of the
feasible solution space first.
 Find out the value of objective function for each of those
corner points.
 The optimum value and its associated point is the solution.
Example : Chemistry of Garden
 The model was –
 Decision Variable
 Let X1 be the number of Jars to be purchased.
 Let X2 be the number of Carton to be purchased.

 Objective Function
 Min Z = 3.X1 + 2.X2

 Constraints
 5.X1 + X2 ≥ 10 [ Requirement constraint for chemical A ]
 2.X1 + 2.X2 ≥ 12 [ Requirement constraint for chemical B ]
 X1 + 4.X2 ≥ 12 [ Requirement constraint for chemical C ]
 X1, X 2 ≥ 0 [ Non-Negativity Constraints]
Solution

Corner Coordinat Z=3.X1+2.


Point es X2
A
A (0, 10) 20
B (1, 5) 13
C (4, 2) 20
D (12, 0) 36

Answer : X1 = 1, X2 = 5,
B
Z = 13

C
D
Example : Reddy Mikks Company
 The model was –
 Decision Variable
 Let X1 be the number of Exterior paints.
 Let X2 be the number of Interior paints.

 Objective Function
 max Z = 5.X1 + 4.X2

 Constraints
 6.X1 + 4.X2 ≤ 24 [ Availability constraint for raw material M1 ]
 X1 + 2.X2 ≤ 6 [ Availability constraint for raw material M2 ]
 X2 – X1 ≤ 1 [ Demand constraint for Interior & Exterior Paint ]
 X2 ≤ 2 [ Demand constraint for Interior paint ]
 X1, X 2 ≥ 0 [ Non-Negativity Constraints]
Solution

Corner Coordinat Z=5.X1+4.


Point es X2
A (0, 0) 0
B (0, 1) 4
C (1, 2) 13
D (2, 2) 18
E (3, 1.5) 21
C D F (4, 0) 20
Answer : X1 = 3, X2 =
B E 1.5, Z = 21

A F
Solution Cases
 Unique optimal solution
 Only a single corner point associated with optimum solution results in
unique optimal solution.
 Examples we have done this far.

 Infinite number of optimal solutions


 If more than one corner point associated with optimum solution then it
results in infinite number of optimal solutions.
 All the points on the line joining such two points will result in optimal
solution.
 Unbounded Solution
 If all the constraints of a maximization problem provide only lower bound,
then the problem has unbounded solution.
 In this case, the optimum value occurs at infinity.

 No solution
 If no common area is shared by all the constraints then there is no
Infinite Number of Optimal Solutions
 Maximize Z = 100X1 + 40X2
Subject to,
5X1 + 2X2 ≤ 1000
3X1 + 2X2 ≤ 900
X1 + 2X2 ≤ 500
X1, X2 ≥ 0
Corner Coordinate Z=100.X1+4
Point s 0.X2
A (0, 250) 10000
A
B (125, 187.5) 20000
C (200, 0) 20000 B
D (0, 0) 0
 All the points on the line BC
will give optimal result. C
 How can you give an example D
yourself of this case?
Unbounded Solution
 Maximize Z = 3X1 + 2X2
Subject to,
X1 + X2 ≥ 3
X1 - X2 ≤ 1
X1, X2 ≥ 0
 All the constraints only lower
bound the feasible solution
space.
 Therefore, maximum value
lies at infinity.
 How can you give an example
yourself of this case?
No Feasible Solution
 Maximize Z = X1 + X2
Subject to,
-3X1 + X2 ≥ 3
X1 + X2 ≤ 1
X1, X2 ≥ 0
 No common area for all the
constraints.
 Therefore, no solution
exists.
Summary
 Using graphical LPP with two variables can be solved.
 To solve it, plot the lines representing all the constraints
and find out the sides that satisfies the constraints.
 The common area that satisfies all the constraints
represents the feasible solution area.
 The optimum feasible solution point situated at any of the
corner points.
 Find objective values for all the corner points to determine
the optimum solution.
 There can be special cases like Unbound, infinite and no
solution.
Thank You!

You might also like