How to Maximize Linear Programming

Linear programming problems consist of a single linear equation subject to one or more constraints in the form of linear inequalities. The overall goal in solving this type of problem is to find the maximum or minimum available output. Economists use linear programming problems when a company or person wishes to maximize profits for a given product consisting of multiple variables. If you clearly define the equations and constraints within the problem, it is relatively easy to optimize the results.

Things You'll Need

  • Pencil
  • Paper
  • Graphing calculator
Show More

Instructions

    • 1

      Separate the initial or "objective" equation from the constraints. This will help you get a better understanding of what the problem requires and exactly what you are dealing with in the problem.

    • 2

      Write out all of the equations on a piece of paper. Make sure to separate the constraints from the objective equation.

    • 3

      Solve all of the constraints for one variable. Put the solution variable on the right side of the equations and the other variables and constants on the left side.

    • 4

      Draw a graph using the variable you solved for as the vertical axis and the other variable as the horizontal axis; traditionally the "y" variable is on the vertical axis. The vertical line is the dependent variable and the horizontal line is the independent variable. Once you have solved each constraint for a specific variable, each equation will represent a line.

    • 5

      Choose an arbitrary number and substitute it for the independent variable in one of the constraint equations. Solve the equation.

    • 6

      Use the point you chose along with the solution to the equation to plot a point on the graph. The two values will comprise an ordered pair. Choose another number and solve the equation to plot another point.

    • 7

      Connect the two points in a straight line. The line is a representation of the equation.

    • 8

      Shade the area of the graph that corresponds to the constraint. For example, if the initial constraint was on all points greater than the equation, shade all points above the line on the graph.

    • 9

      Plot two points for each of the other equations, draw their corresponding lines and shade the constrained area. Alternatively, you can use a graphing calculator to graph each line. The unshaded area of the graph is the set of all possible solutions, or the solution set.

    • 10

      Look at the graph and determine which lines intersect. Each point of intersection will appear as a vertex on the solution set. Vertexes connected by line segments will surround the solution set. When two lines intersect, they form one of these vertexes.

    • 11

      Set the constraint equations of the two lines that comprise a vertex equal to each other. Combine all like terms and solve the equation for the independent variable. Substitute the solution into one of the two equations to get the dependent variable; together they make up the coordinates of the point at which both lines intersect. Repeat the process for each vertex and write down all of the ordered pairs.

    • 12

      Substitute each pair of points into the objective equation and solve. The solution with the largest numerical value is the maximum output for the problem, given the established constraints.

Learnify Hub © www.0685.com All Rights Reserved