This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Lecture 4: Graphical Solution August 30, 2010 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 nonnegativity constraints This is a linear program. How do we solve it? We can actually solve it graphically. 2 For example: 1x 1 + 2x 2 6 x 1 x 2 3 1x 1 + 2x 2 = 6 6 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 nonnegativity constraints This is a linear program. How do we solve it? We can actually solve it graphically....
View
Full
Document
This note was uploaded on 09/27/2010 for the course GE 330 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.
 Spring '08
 Staff

Click to edit the document details