final 2009 - Name: _ Signature: _ Theory CEE 5290/COM S...

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

View Full Document Right Arrow Icon
1 Name: _______________ ____________ Signature: ___________________________ Theory CEE 5290/COM S 5722/ORIE 5340 Heuristic Methods for Optimization Fall 2009 Final 12/10/2009 (Show your work so the grader can read and understand what you have done. Clearly state any assumptions you make and give any equations (if any) you are using.) You may have your lecture notes, your own handwritten notes, copies of your homework and posted homework solutions. You cannot have copies of old exams, copies of the textbook or any papers. Note you are asked to write on the last page and turn it in with your exam book. 1. (10 points) Assume you want to minimize f(x) for x in a set D. The global minimum of f(x) occurs at a point z . You have an algorithm A that searches for the global minimum of f(x). Let x i be the current value of the solution in the i th iteration . So A generates a series {x i } Assume A reaches the global solution on the 1000 th iteration. However, you don’t know this x 1000 is z ( the global optimal solution), and you continue to run the algorithm forever so there is an infinite series
Background image of page 1

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

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

This note was uploaded on 10/02/2011 for the course ORIE 5430 taught by Professor Shoemaker during the Fall '11 term at Cornell University (Engineering School).

Page1 / 3

final 2009 - Name: _ Signature: _ Theory CEE 5290/COM S...

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

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