Scribd
Upload
2K views

Linear Programming - Graphical Solution

The document discusses solving linear programming problems (LPPs) graphically. It provides the steps for the graphical method which are to formulate the LPP, draw the graph, obtain the feasible region from the constraints, find the corner points as solutions, calculate the objective function values at these points, and select the optimal solution based on maximization or minimization. An example problem is presented and solved graphically showing the feasible region and optimal solution. Different types of solutions for LPPs are also defined such as unique, multiple, infeasible, and unbounded solutions.

Uploaded by

Tunisha Bhadauria
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
2K views

Linear Programming - Graphical Solution

The document discusses solving linear programming problems (LPPs) graphically. It provides the steps for the graphical method which are to formulate the LPP, draw the graph, obtain the feasible region from the constraints, find the corner points as solutions, calculate the objective function values at these points, and select the optimal solution based on maximization or minimization. An example problem is presented and solved graphically showing the feasible region and optimal solution. Different types of solutions for LPPs are also defined such as unique, multiple, infeasible, and unbounded solutions.

Uploaded by

Tunisha Bhadauria
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 17

3

Linear ProgrammingGraphical Solution

Operations Research

Graphical Solutions to A LPP


Working procedure for graphical method

Step 1: Formulate the appropriate LPP.


Step 2: Draw the graph of the LPP. Step 3: Obtain a feasible region (a region which is common to all the constraints of the LPP which is a convex region). Step 4: Obtain the solution points (the corner points of the feasible region) Step 5: Calculate the values of objective function at the solution points. Step 6: For maximisation problem, the optimum solution is the solution point which gives the maximum value of the objective function and for minimisation problems the optimum solution is the solution point that gives the minimum value of the objective function.
Operations Research

Graphical Solutions to A LPP


Maximize Z = 40x1 + 35x2 Subject to 2x1 + 3x2 60 4x1 + 3x2 96 x 1, x 2 0

Operations Research

(using Iso-profit Lines)


x2 30

Profit = Rs 1120 Iso-profit Lines

20

10 FR

Profit = Rs 1000

Profit = Rs 280

10

20

xResearch R Operations 1 30

Graphical Solutions to A LPP


Optimal Solution (unique)
Point O A B C x1 0 0 18 24 x2 0 20 8 0 Z 0 700 1000 960

Optimal Solution (unique)


Operations Research

Graphical Solutions to A LPP


Working procedure for graphical method

Step 1: Formulate the appropriate LPP.


Step 2: Draw the graph of the LPP. Step 3: Obtain a feasible region (a region which is common to all the constraints of the LPP which is a convex region). Step 4: Obtain the solution points (the corner points of the feasible region) Step 5: Calculate the values of objective function at the solution points. Step 6: For maximisation problem, the optimum solution is the solution point which gives the maximum value of the objective function and for minimisation problems the optimum solution is the solution point that gives the minimum value of the objective function.
Operations Research

Graphic Solution: Max Problem


Maximize Z = 40x1 + 35x2 Subject to 2x1 + 3x2 60 4x1 + 3x2 96 x 1, x 2 0
Point x1 0 0 18 24 x2 0 20 8 0 Z 0 700 1000 960 O A B

x2
30 20 10

A B O
10 20

30

x1

Optimal Solution (unique)


Operations Research

Graphic Solution: Max Problem

(using Iso-profit Lines)


Profit = Rs 1120 Iso-profit Lines

x2 30

20

10 FR

Profit = Rs 1000

Profit = Rs 280

10

20

xResearch R Operations 1 30

Graphic Solution: Min Problem


Minimize Z = 40x1 + 24x2 Subject to 20x1 + 50x2 4800 80x1 + 50x2 7200 and x1 x2 0
Point P Q R x1 0 40 240 x2 144 20 8 Z 3456 3520 9600

144 108 72 36

Feasible Region

Optimal Solution R

60

120

180

240

Operations Research

Bounded and Unbounded Feasible Regions

Bounded Feasible Region FR

Unbounded Feasible Region

FR

Operations Research

Redundant Constraints
Minimize Z = 40x1 + 35x2 Subject to x1 + x2 40 4x1 + 3x2 96 2x1 + 3x2 60 x1, x2 0

x2

Redundant Constraint x1 + x2 = 40 4x1 + 3x2 = 96

2x1 + 3x2 = 60

x1

Operations Research

Binding and Non-binding Constraints


Binding Constraint: If the LHS is equal to RHS when optimal values of the decision variables are substituted in to the constraint Non-binding Constraint: If LHS RHS on such substitution of optimal values
For min problem solution,

200 + 50144 = 7200 4800 (RHS) 800 + 50144 = 7200 (=RHS)

Binding constraint Non-Binding constraint


Operations Research

Solutions to LPPs
Unique Optimal Solution Multiple Optimal Solutions

Infeasibility: No feasible solution


Unbounded Solution

Operations Research

Graphical Solutions to A LPP


Maximize Z = 40x1 + 35x2 Subject to 2x1 + 3x2 60 4x1 + 3x2 96 x 1, x 2 0

Operations Research

Graphical Solutions to A LPP

The solution space (feasible region) is ABCDE. The co-ordinates of the corner points of the feasible region are obtained and is given in the above figure. The values of the objective function at the corner points are z = x1 2x2
Operations Research

Graphical Solutions to A LPP

Since the problem is of maximisation type the optimal solution is x1 = 5, x2 = 2 with maximum of z = 1
Redundant constraint: In a given LPP if any constraint does not affect the feasible region, then the constraint is said to be a redundant constraint.
Operations Research

Solutions of LPP
Infinite number of solutions: In some cases the maximum or minimum value of z occurs at more than one corner point of a feasible region. A point on the line joining that points will also give the same maximum/minimum value of z. Thus, there are infinite number of optimal solutions for this LPP. An LPP having more than one optimal solution is said to have alternate or multiple optimal solutions. That is the resources can be combined in more than one way to maximise the profit. Unbounded solution: When the value of decision variables in linear programming is permitted to increase infinitely without violating the feasibility condition, then the solution is said to be unbounded. Here the objective function value can also be increased indefinitely. In graphical method if the feasible region is unbounded then we have to find the value of the objective function at the known corner points. If there are some points in the feasible region which give greater / lesser value of the objective function then we conclude that LPP has an unbounded solution. No feasible solution: If there is no feasible region, we conclude that there exists no feasible solution to the given LPP.
Operations Research

You might also like