sulpcegu5e ppt 11_8

10
Section 11.8 Linear Programming

Upload: silvia

Post on 18-Jan-2015

342 views

Category:

Sports


2 download

DESCRIPTION

 

TRANSCRIPT

Page 1: Sulpcegu5e ppt 11_8

Section 11.8

Linear Programming

Page 2: Sulpcegu5e ppt 11_8

OBJECTIVE 1

Page 3: Sulpcegu5e ppt 11_8
Page 4: Sulpcegu5e ppt 11_8
Page 5: Sulpcegu5e ppt 11_8

OBJECTIVE 2

Page 6: Sulpcegu5e ppt 11_8

Consider the linear programming problem

Maximize: 0.05 0.08

subject to the conditions that

0

0

30

20

5

I x y

x

y

x y

x

y

Page 7: Sulpcegu5e ppt 11_8
Page 8: Sulpcegu5e ppt 11_8
Page 9: Sulpcegu5e ppt 11_8

Minimize the expression 3 4

subject to the constraints

7 10 5 0 0

z x y

y x x y x y

Page 10: Sulpcegu5e ppt 11_8

A factory manufactures two kinds of ice skates: racing skates and figure skates. The racing skates require 8 work hours in the fabrication department, whereas the figure skates require 4 work hours there. The racing skates and the figures skates each require 2 work hours in the finishing department. The fabricating department has available at most 224 work hours per day, and the finishing department has no more than 72 work hours per day available. If the profit on each racing skate is $15 and the profit on each figure skate is $12, how many of each should be manufactured each day to maximize profit? (Assume that all skates made are sold.)