lecture9

# lecture9 - Multiperiod Planning Soft Constraints Goal...

This preview shows pages 1–2. 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: Multiperiod Planning Soft Constraints Goal Programming IE426: Optimization Models and Applications: Lecture 9 Jeff Linderoth Department of Industrial and Systems Engineering Lehigh University September 26, 2006 Jeff Linderoth IE426:Lecture 9 Multiperiod Planning Soft Constraints Goal Programming Quiz #1 Closed Book, Closed Notes. 75 minutes. (It took me 31 minutes to take the quiz). 4 problems: 1 “Short Answer” (35%) , 3 modeling. Jeff Linderoth IE426:Lecture 9 Multiperiod Planning Soft Constraints Goal Programming Convexity How to tell if a function is convex/concave... “Line over/under” test. Examine the Hessian (matrix of 2nd partial derivatives). If “numerical”, I will only ask you for “simple” functions, in which x ∈ R 2 How to tell if a set is convex “Line inside” test How to use this information about region shape to know whether a problem is easy or hard. Jeff Linderoth IE426:Lecture 9 Multiperiod Planning Soft Constraints Goal Programming Other Things LP Graphing feasible regions Solving LPs by graphing Properties of LP solution Optimal solution occurs at an extreme point!Optimal solution occurs at an extreme point!...
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 / 3

lecture9 - Multiperiod Planning Soft Constraints Goal...

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

View Full Document
Ask a homework question - tutors are online