lecture23 - Review MINLP? IE426: Optimization Models and...

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: Review MINLP? IE426: Optimization Models and Applications: Lecture 23 Jeff Linderoth Department of Industrial and Systems Engineering Lehigh University December 5, 2006 Jeff Linderoth IE426:Lecture 23 Review MINLP? Review? Final: 12/7, 2:455:45 Packard Lab Review Session: 12/3, 9:3011AM, Mohler Lab, Room 355. Practice Final Posted. You do not need to know about KKT conditions, or determining whether a potential solution is optimal. Jeff Linderoth IE426:Lecture 23 Review MINLP? Solving Newsvendor Problems By Hand Please look at the Homework #4 solutions about solving Newsvendor problems by hand. If you dont understand this, please let me know now! Jeff Linderoth IE426:Lecture 23 Review MINLP? Class Review Categories of Optimization Problems Which are easy and which are hard. To answer this question, you need to know about convexity How to tell if a function is convex/concave... Line over/under test. Examine the Hessian (matrix of 2nd partial derivatives). I would only ask you for x 2 How to tell if a set is convex Line inside test Jeff Linderoth IE426:Lecture 23 Review MINLP? Optimization Flash Cards maximize 3 x 1 + 2 x 2 + 7 x 3- 2 x 4 + 5 x 5 subject to 2 x 1- x 2 = 3 x 2- x 4 = 7 x 3 = 6- x 3 + x 4- x 5 = 9 x 1 , x 2 , x 3 , x 4 , x 5 Jeff Linderoth IE426:Lecture 23 Review MINLP?...
View Full Document

This note was uploaded on 02/29/2008 for the course IE 426 taught by Professor Linderoth during the Spring '08 term at Lehigh University .

Page1 / 5

lecture23 - Review MINLP? IE426: Optimization Models and...

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