IEOR162_Midterm_Fall07 - IEOR 162 Linear programming...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: IEOR 162 Linear programming (Undergraduate) Midterm, Fall 2007 Instructor: Ying-Ju Chen There are four questions in this midterm. Please answer three of them. If you attempt all the four questions, only three of them, selected randomly, will be graded. Please write down your name on the first page. Good luck! 1. Graphically solve the following linear programming problem: Min Z = 6 X 1 + 2 X 2 3 X 1 + 2 X 2 12 2 X 1 + 4 X 2 12 X 2 1 X 1 0 X 2 0 Please identify the solution(s) on your graph and briefly explain how you obtain the feasible region, the isoprofit lines, and the optimal solution(s). 2. Chemco produces two chemicals: A and B. These chemicals are produced via two manufacturing processes. Process 1 requires 2 hours of labor and 1 lb of raw material to produce 2 oz of A and 1 oz of B. Process 2 requires 3 hours of labor and 2 lb of raw material produce 2 oz of A and 1 oz of B....
View Full Document

This note was uploaded on 09/06/2009 for the course IEOR 162 taught by Professor Zhang during the Spring '07 term at University of California, Berkeley.

Page1 / 4

IEOR162_Midterm_Fall07 - IEOR 162 Linear programming...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online