{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture4 - Lecture 4 Graphical Solution Announcements Labs...

This preview shows pages 1–8. Sign up to view the full content.

Lecture 4: Graphical Solution August 30, 2010

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Announcements Labs begin this week Attendance will be taken in labs First homework will given on Friday Next lecture will be a problem solving lecture
Reddy Mikks Case: Formulation Maximize 5 x 1 + 4 x 2 Subject to 6 x 1 + 4 x 2 24 M1 availability 1 x 1 + 2 x 2 6 M2 availability - 1 x 1 + x 2 1 market limit x 2 2 demand limit x 1 , x 2 0 nonnegativity constraints This is a linear program. How do we solve it? We can actually solve it graphically. 2

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
For example: 1x 1 + 2x 2 6 x 1 x 2 3 1x 1 + 2x 2 = 6 6

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
x 1 x 2 3 1x 1 + 2x 2 = 6 6 (0,0) 1x 1 + 2x 2 6
Reddy Mikks Case: Formulation Maximize 5 x 1 + 4 x 2 Subject to 6 x 1 + 4 x 2 24 M1 availability 1 x 1 + 2 x 2 6 M2 availability - 1 x 1 + x 2 1 market limit x 2 2 demand limit x 1 , x 2 0 nonnegativity constraints This is a linear program. How do we solve it? We can actually solve it graphically.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 14

Lecture4 - Lecture 4 Graphical Solution Announcements Labs...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online