MIE376 Lec 5 - NLPQPv2.page09

MIE376 Lec 5 - NLPQPv2.page09 - ± Nearly impossible to...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
MIE376 - Mathematical Programming 9 Objective Function is NOT smooth or convex ± No guarantee of optimality ± Local optima can be pervasive ± Many techniques – few are attractive
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ± Nearly impossible to predict which method works best. ± Need to consult others who solved similar problems ± In some cases Dynamic Programming may be used...
View Full Document

This note was uploaded on 07/10/2011 for the course MIE 376 taught by Professor Daniel during the Spring '11 term at University of Toronto- Toronto.

Ask a homework question - tutors are online