CSE324: Operations Research and 
      Management Systems
             Lec03
          Graphical Method for 
          Linear Programming
 Graphical Method for Two-variable LP
   •  Many types of algorithms have been developed over the years 
      to solve LP like the Simplex method, the Hungarian approach, 
      etc.…
   •  Graphical method is the most basic methods to handle an LP 
      problem.
   •  It 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 increases. 
   •  For the graphical method, two-variable LP problems are 
      considered here.
   •  Two-variable problems hardly exist in practice !!
   •  They provide intuition and concrete foundations for the 
      development of the general simplex algorithm.
         10/3/2020                CSE324 OR: Lec03                  2
 Visualizing Linear Inequalities
    • To visualize the following 
      inequality:
    • Rewrite the inequality as: 
    • Draw the inequality 
      boundary line. 
    • How to determine the 
      satisfiability of each region?
         10/3/2020                  CSE324 OR: Lec03                    3
 Back to Giapetto’s Woodcarving LP Problem
       10/3/2020            CSE324 OR: Lec03            4