SlideShare a Scribd company logo
Abhishek Kumar
M.com
The graphical method of solving a linear
programming problem can be used when there
are only two decision variables. If the problem
has three or more variables, the graphical
method is not suitable. In that case we use the
SIMPLEX METHOD which will be discussed
separately by our fellow classmate .
Let’s understand some important
definitions and concepts before
moving on with the Graphical Method:
1. Solution: A set of decision variables values which
satisfy all the constraints of an LPP.
2. Feasible solution: Any solution which also satisfies
the non-negativity limitations of the problem.
3. Optimal feasible solution: Any feasible solution which
maximizes or minimizes the objective function.
4. Feasible Region: The common region determined by all
the constraints and non-negativity limitations of an LPP.
5. Corner point: A point in the feasible region that is the
intersection of two boundary lines
Procedure
• Step 1: Convert each inequality as equation
• Step 2: Plot each equation on the graph
• Step 3: Shade the ‘ Feasible Region’. Highlight the
common Feasible region.
 Feasible Region :Set of all possible solutions.
• Step 4 : Compute the coordinates of the corner
points (of the feasible region). These corner
points will represent the ‘Feasible Solution’.
Feasible Solution: If it satisfies all the constraints and
non negativity restrictions.
Procedure( Cont..)
• Step 5 : Substitute the coordinates of the corner
points into the objective function to see which gives
the Optimal Value. That will be the ‘Optimal
Solution’.
Optimal Solution : If it optimizes (maximizes or
minimizes) the objective function.
Unbounded Solution : If the value of the objective
function can be increased or decreased indefinitely,
Such solutions are called Unbounded solution.
Inconsistent Solution : It means the solution of
problem does not exist. This is possible when there is
no common feasible region.
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
Graphical RepresentationLinear programming
 The graphical method is one of the easiest way to solve a small LP
problem. However this is useful only when the decision variables are
not more than two. It is not possible to plot the solution on a two-
dimensional graph when there are more than two variables and we
must turn to more complex methods.
 Another limitation of graphical method is that, an incorrect or
inconsistent graph will produce inaccurate answers, so one need to
be very careful while drawing and plotting the graph.
 A very useful method of solving linear programming problems of any
size is the so called Simplex method.
Limitation of Graphical Method
Thank You

More Related Content

PPTX
Linear Programming Problem
PPTX
Linear programming: A Geometric Approach
PPTX
LINEAR PROGRAMMING Assignment help
PPTX
Linear Programming
PPT
001 lpp introduction
PPT
Lecture 4 duality and sensitivity in lp
DOCX
Linear programing
PDF
Karmarkar's Algorithm For Linear Programming Problem
Linear Programming Problem
Linear programming: A Geometric Approach
LINEAR PROGRAMMING Assignment help
Linear Programming
001 lpp introduction
Lecture 4 duality and sensitivity in lp
Linear programing
Karmarkar's Algorithm For Linear Programming Problem

What's hot (20)

PDF
linear programming
PPTX
Linear Programming
PDF
Linear programing
PPT
Linear programming
PPTX
A brief study on linear programming solving methods
PDF
Unit.2. linear programming
PPTX
Dynamic Programming
PPT
Dynamic programming 2
PPTX
What Is Dynamic Programming? | Dynamic Programming Explained | Programming Fo...
PPTX
Introduction to Dynamic Programming, Principle of Optimality
PPTX
Dynamic programming
PPTX
Introduction to dynamic programming
PPTX
Dynamic programming class 16
PPTX
Dynamic programming
PPTX
Canonical form and Standard form of LPP
PDF
Unit.4.integer programming
PDF
Divide&Conquer & Dynamic Programming
PDF
Numerical analysis m3 l2slides
PDF
Linear Programming Module- A Conceptual Framework
PDF
Unit.3. duality and sensetivity analisis
linear programming
Linear Programming
Linear programing
Linear programming
A brief study on linear programming solving methods
Unit.2. linear programming
Dynamic Programming
Dynamic programming 2
What Is Dynamic Programming? | Dynamic Programming Explained | Programming Fo...
Introduction to Dynamic Programming, Principle of Optimality
Dynamic programming
Introduction to dynamic programming
Dynamic programming class 16
Dynamic programming
Canonical form and Standard form of LPP
Unit.4.integer programming
Divide&Conquer & Dynamic Programming
Numerical analysis m3 l2slides
Linear Programming Module- A Conceptual Framework
Unit.3. duality and sensetivity analisis
Ad

Similar to Graphical RepresentationLinear programming (20)

PPTX
SOLUTION OF LIN-WPS Office for +3 2nd year students.pptx
PPTX
Unit 2.pptx
PDF
CMR_Graphical Method -Special cases.pdf
PPTX
12001319032_OR.pptx
PPTX
Linear Programing.pptx
PDF
Linear Programming (graphical method)
PPTX
Simplex method material for operation .pptx
PPTX
linear programming
PPT
BBM-501-U-II_-_Linear_Programming (1).ppt
PPSX
Graphical method
PDF
LPP, Duality and Game Theory
PPTX
linearprogramingproblemlpp-180729145239.pptx
PPTX
Lecture5-7_12946_Linear Programming The Graphical Method.pptx
PPT
5163147.ppt
PPTX
PPTX
Solving linear programming model by Simplex method.pptx
PPTX
240591lecture_5_graphical_solution-1688128227959.pptx
PPTX
Quantitativetechniqueformanagerialdecisionlinearprogramming 090725035417-phpa...
PDF
Em8720 e
PPTX
Operation reasearch
SOLUTION OF LIN-WPS Office for +3 2nd year students.pptx
Unit 2.pptx
CMR_Graphical Method -Special cases.pdf
12001319032_OR.pptx
Linear Programing.pptx
Linear Programming (graphical method)
Simplex method material for operation .pptx
linear programming
BBM-501-U-II_-_Linear_Programming (1).ppt
Graphical method
LPP, Duality and Game Theory
linearprogramingproblemlpp-180729145239.pptx
Lecture5-7_12946_Linear Programming The Graphical Method.pptx
5163147.ppt
Solving linear programming model by Simplex method.pptx
240591lecture_5_graphical_solution-1688128227959.pptx
Quantitativetechniqueformanagerialdecisionlinearprogramming 090725035417-phpa...
Em8720 e
Operation reasearch
Ad

Recently uploaded (20)

PPTX
Introduction-to-Cloud-ComputingFinal.pptx
PPTX
Introduction to Knowledge Engineering Part 1
PPTX
iec ppt-1 pptx icmr ppt on rehabilitation.pptx
PPTX
Database Infoormation System (DBIS).pptx
PPTX
DISORDERS OF THE LIVER, GALLBLADDER AND PANCREASE (1).pptx
PPTX
ALIMENTARY AND BILIARY CONDITIONS 3-1.pptx
PDF
22.Patil - Early prediction of Alzheimer’s disease using convolutional neural...
PDF
Taxes Foundatisdcsdcsdon Certificate.pdf
PPTX
Logistic Regression ml machine learning.pptx
PPTX
advance b rammar.pptxfdgdfgdfsgdfgsdgfdfgdfgsdfgdfgdfg
PPTX
Major-Components-ofNKJNNKNKNKNKronment.pptx
PPT
Quality review (1)_presentation of this 21
PPTX
climate analysis of Dhaka ,Banglades.pptx
PDF
Mega Projects Data Mega Projects Data
PPTX
A Quantitative-WPS Office.pptx research study
PDF
.pdf is not working space design for the following data for the following dat...
PDF
Recruitment and Placement PPT.pdfbjfibjdfbjfobj
PPTX
Bharatiya Antariksh Hackathon 2025 Idea Submission PPT.pptx
PPTX
STUDY DESIGN details- Lt Col Maksud (21).pptx
PPTX
IB Computer Science - Internal Assessment.pptx
Introduction-to-Cloud-ComputingFinal.pptx
Introduction to Knowledge Engineering Part 1
iec ppt-1 pptx icmr ppt on rehabilitation.pptx
Database Infoormation System (DBIS).pptx
DISORDERS OF THE LIVER, GALLBLADDER AND PANCREASE (1).pptx
ALIMENTARY AND BILIARY CONDITIONS 3-1.pptx
22.Patil - Early prediction of Alzheimer’s disease using convolutional neural...
Taxes Foundatisdcsdcsdon Certificate.pdf
Logistic Regression ml machine learning.pptx
advance b rammar.pptxfdgdfgdfsgdfgsdgfdfgdfgsdfgdfgdfg
Major-Components-ofNKJNNKNKNKNKronment.pptx
Quality review (1)_presentation of this 21
climate analysis of Dhaka ,Banglades.pptx
Mega Projects Data Mega Projects Data
A Quantitative-WPS Office.pptx research study
.pdf is not working space design for the following data for the following dat...
Recruitment and Placement PPT.pdfbjfibjdfbjfobj
Bharatiya Antariksh Hackathon 2025 Idea Submission PPT.pptx
STUDY DESIGN details- Lt Col Maksud (21).pptx
IB Computer Science - Internal Assessment.pptx

Graphical RepresentationLinear programming

  • 2. The graphical method of solving a linear programming problem can be used when there are only two decision variables. If the problem has three or more variables, the graphical method is not suitable. In that case we use the SIMPLEX METHOD which will be discussed separately by our fellow classmate .
  • 3. Let’s understand some important definitions and concepts before moving on with the Graphical Method: 1. Solution: A set of decision variables values which satisfy all the constraints of an LPP. 2. Feasible solution: Any solution which also satisfies the non-negativity limitations of the problem.
  • 4. 3. Optimal feasible solution: Any feasible solution which maximizes or minimizes the objective function. 4. Feasible Region: The common region determined by all the constraints and non-negativity limitations of an LPP. 5. Corner point: A point in the feasible region that is the intersection of two boundary lines
  • 5. Procedure • Step 1: Convert each inequality as equation • Step 2: Plot each equation on the graph • Step 3: Shade the ‘ Feasible Region’. Highlight the common Feasible region.  Feasible Region :Set of all possible solutions. • Step 4 : Compute the coordinates of the corner points (of the feasible region). These corner points will represent the ‘Feasible Solution’. Feasible Solution: If it satisfies all the constraints and non negativity restrictions.
  • 6. Procedure( Cont..) • Step 5 : Substitute the coordinates of the corner points into the objective function to see which gives the Optimal Value. That will be the ‘Optimal Solution’. Optimal Solution : If it optimizes (maximizes or minimizes) the objective function. Unbounded Solution : If the value of the objective function can be increased or decreased indefinitely, Such solutions are called Unbounded solution. Inconsistent Solution : It means the solution of problem does not exist. This is possible when there is no common feasible region.
  • 18.  The graphical method is one of the easiest way to solve a small LP problem. However this is useful only when the decision variables are not more than two. It is not possible to plot the solution on a two- dimensional graph when there are more than two variables and we must turn to more complex methods.  Another limitation of graphical method is that, an incorrect or inconsistent graph will produce inaccurate answers, so one need to be very careful while drawing and plotting the graph.  A very useful method of solving linear programming problems of any size is the so called Simplex method. Limitation of Graphical Method