{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

midterm_2006

# midterm_2006 - MS&E 211 Midterm Examination Autumn 2006...

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

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.

Unformatted text preview: MS&E 211 Midterm Examination - Autumn 2006 Page 1 of 9 M IDTERM E XAMINATION MS&E 211 November 2, 2006 INSTRUCTIONS a) Take alternate seating if possible. b) This is an open book and open notes exam. You are not permitted to use computers or any calculator programming functions. c) The examination ends in 75 minutes. d) There are 4 questions plus a bonus problem on this exam. The exam is worth 100 points plus 10 points for a bonus question. HONOR CODE In taking this examination, I acknowledge and accept the Stanford University Honor Code. NAME (signed) NAME (printed) Pr. 1 Pr. 2 Pr. 3 Pr. 4 Bonus Total MS&E 211 Midterm Examination - Autumn 2006 Page 2 of 9 Problem 1 - True or False (20 points) State whether each of the following italicized statements is True or False. Assume all other in- formation given is correct. For each part, only your answer, which should be one of “True” or “False”, will be graded. Explanations will not be read. a) Consider a production problem where a company must decide how many of each of its n products to produce. Production is constrained by the availability of m different types of resources. Assume that we can derive an optimization problem of the following form for this problem where c i is revenue per unit of product i and b j is the amount of resource j available. Maximize c T x subject to Ax ≤ b x ≥ where x ∈ < n , A ∈ < mxn , b ∈ < m , and A is full rank. Assume that m < n and that there is an optimal solution to this problem....
View Full Document

{[ snackBarMessage ]}

### Page1 / 9

midterm_2006 - MS&E 211 Midterm Examination Autumn 2006...

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

View Full Document
Ask a homework question - tutors are online