Linear Programming Notes.notebook

Linear Programming_Notes.notebook

1

September 09, 2014

Bellwork

Get out/grab a calculator...Homework in the tray...

Graph the solution to the inequality

y < 1/2 x + 2

x > 4


2

September 09, 2014

Homework Review


3

September 09, 2014


4

September 09, 2014

Table of Contents

Unit 2: Systems of Eq'ns & Inequalities1. Solving Systems by Graphing 9/022. Elimination and Substitution 9/033. Word Problems 9/044. Inequalities 9/055. Linear Programming 9/08


5

September 09, 2014

9/08Linear

Programming


6

September 09, 2014

Here's what's going to happen...

y < 1/2 x + 2

y > 0

x > 1


7

September 09, 2014

CONSTRAINTS – the inequalities that limit the possible solutions.

LINEAR PROGRAMMING – a method for finding the minimum and maximum values of some quantity given a system.

FEASIBLE REGION – the shaded region created by the intersection of the inequalities; area where every constraint is satisfied

OBJECTIVE FUNCTION – a function of 2 variables (x and y) that is the objective to maximize/minimize such as profits/costs; plug vertices into the function to test.

BOUNDED – a feasible region that creates a polygon where a minimum and maximum value exist

UNBOUNDED – a function where no max/min (depending) exist; feasible region doesn't create a polygon.

VERTEX PRINCIPLE If there is a max/min then it occurs at one of the vertices of the feasible region.


8

September 09, 2014


9

September 09, 2014

constraints:


10

September 09, 2014


11

September 09, 2014


12

September 09, 2014

Bellwork

Get out/grab a calculator...Homework in the tray...

Project on the back group of 3...

Solve using substitution.

y + 2x = 14

2y x = 3


13

September 09, 2014


14

September 09, 2014


15

September 09, 2014


16

September 09, 2014


17

September 09, 2014


18

September 09, 2014

Worksheet (pg 3 and 4) for HW

Documents

Linear Programming Notes.notebook