ABSTRACT
Many quantitative methods become difficult to apply to decisions where there are many decision variables and or many possible actions per decision variable. Determination of the best action through brute force enumeration of the possible actions even using high speed computers often is too expensive and or time-consuming to be used on a regular basis to solve large complex problems. The decision variables in linear program (LP) linear expressions are independent of each other and stand alone in the objective function and the resource constraints. LP linear expressions have no multiplication of decision variables. The Graphical Method is an instructional technique for solving a LP. Initially, the Graphical Method requires the feasible region to be determined. The feasible region is determined by first plotting the lines associated with each linear constraint on the non-negative decision variables and then identifying the area of intersection.
