Download presentation

Presentation is loading. Please wait.

Published byOwen Rees Modified over 3 years ago

1
3.4 Linear Programming 10/31/2008

2
Optimization: finding the solution that is either a minimum or maximum

3
Linear Programming Optimize an objective function subject to constraints Graph of constraints is called the Feasible Region A minimum or maximum can only occur at a vertex of the feasible region

4
Example 1 (ex1)C = - x +3y Objective Function Find the min/max subject to the following constraints: Step 1: Graph the system of inequalitiesGraph

5
Step 2: Find intersections of the boundary lines: List of Vertices: (2,0), (5,0), (2,8) and (5,2)

6
Step 3: Test the vertices in the objective function C= -x +3y Minimum Maximum

7
Example 2 (ex 2) For the objective function C= x+5y find the minimum and maximum values subject to the following constraints:

8
Graph System Graph constraints Find intersections points: Intersection points (0,2) and (1,4)

9
Test the vertices in the objective function: Minimum Maximum??? Wait this is smaller???

10
Closure Note: If the feasible region is unbounded (open on a side) there may not be a minimum or maximum.

Similar presentations

OK

3.4 – Linear Programming. Ex. 1 Graph the system of inequalities. Name the coordinates of the vertices of the feasible region. Find the max & min values.

3.4 – Linear Programming. Ex. 1 Graph the system of inequalities. Name the coordinates of the vertices of the feasible region. Find the max & min values.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Download ppt on teamviewer 9 Ppt on regular expression validator Ppt on power grid failure book Ppt on suspension type insulation tool Ppt on x ray diffraction Ppt on endangered species of birds Ppt on power sharing in india Ppt on total parenteral nutrition ppt Ppt on time response analysis in control Download ppt on teamviewer download