6.6 Optimazation Problems: Linear Programming

On Tuesday we started 6.6 Linear Programming. Linear Programming is a mathematical technique used to determine which solutions in the feasible region result in the optimal solutions of the objective function.

To solve this, first you find the linear inequalities and put them on a graph. After that you fine the maximum and minimum values of the objective function. You can do this by using a vertex/value chart. Then using the information from this chart make a statement showing your results.

We were given five steps in using Linear Programming to solve an optimization problem which includes the information we have learnt in 6.4 , 6.5, and 6.6.

The steps are as followed:

1. Define: - Variable

- Domain/Range

- Inequalities (Constraints)

- Objective Function

2. Graph

3. Evaluate the objective function at the vertices's

4. Analyse and Interpret - choose desired solution

5. Verify

After we went through EX.1 on the handout Mr.Banow gave us. Question found below in picture.

For practise we got assigned Page 341-345 # 1,2,4,6,11,13

:)