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
Unformatted text preview: ENGR62/MS&E111 Fall 2006 Introduction to Optimization November, 2006 Prof. Ben Van Roy Midterm Exam Instructions • This is a take-home, open book/notes exam. • There are 4 questions. Each is worth a total of 20 points. Partial credit is possible for each question provided that what you hand in is relevant and partially solves a problem. • The exam is due at Terman 324 by 5:00PM. A TA will be there from 4:30-5:00PM to collect your exams. If you finish early, you can slip your exam under the office door. Late exams will not be accepted. The entrance on the east side of Terman (i.e., the one closest to the Quad) should be open- if not your Stanford ID can get you in. • Collaboration is not permitted on this exam. Exam-related questions will not be answered by the teaching staff (unless you think there is a serious exam typo). If you are unsure about something in a question, do your best to answer it with the information given. • Questions 3 and 4 require the use of Excel. Be sure to check off “Assume Linear Model”. Please print out and hand in with your exam the worksheets you use to solve the problems (no solution reports are necessary). • Also, print out and attach to the front of your exam this cover sheet with the honor code statement signed. • GOOD LUCK! Honor Code In recognition of and in the spirit of the Honor Code, I certify that I will neither give nor receive unpermitted aid on this examination and that I will report, to the best of my ability, all Honor Code violations observed by me. Name: Signature: 1: The Geometry of Linear Programming (a) (10 points) Consider a polyhedron in 2-dimensional Euclidean space defined by 5 inequality constraints....
View Full Document
This note was uploaded on 10/12/2009 for the course ENGR 62 taught by Professor Unknown during the Spring '06 term at Stanford.
- Spring '06