Decision Chapter 6: Linear Programming

11 flashcards · Mathematics · by TheoTyson

1. Decision Variables

   The numbers of each of the things that can be varied.

2. Objective Function

   The algebraic expression to be maximised or minimised.

3. Constraints

   Things preventing you from using an infinite number of each of the variables. They are in the form of inequalities.

4. Feasible Solution

   Values for the decision variables that satisfy each constraint.

5. Feasible Region

   The region that contains all of the feasible values.

6. Optimal Solution

   The feasible solution that meets the objective (maximised or minimised).

7. Formulate a Linear Programming Problem

   Define the decision variables. State the objective and objective function. Write the constraints as inequalities.

8. Shading on a Linear Programming Graph

   Shade any areas of the graph that fail to satisfy any of the inequalities.

9. Objective Line Method

   Make a line parallel to the objective and find the first point for a minimum, and the last point for a maximum.

10. Vertex Testing Method

    Find the coordinates of each vertex of the feasible region. Evaluate the objective function. Select the vertex that gives the optimal solution.

11. Solutions with Integer Values

    Consider points with integer values that are closest to the optimal vertex.