This preview shows page 1. Sign up to view the full content.
Unformatted text preview: first-order optimality conditions in finding solutions to NLPs. A second objective is to develop an NLP taxonomy. Objectives: At the end of this lesson, you will be able to: 1. Determine the convexity or concavity of a function, and whether a feasible region is convex. 2. Write out the first-order optimality conditions for a nonlinear program. 3. Explain how NLPs are classified with respect to the nonlinearities in the objective function and constraints. 4. Categorize the degree of difficulty in solving an NLP with respect to the general classification scheme. 5. Set up and solve NLPs with the Excel add-in....
View Full Document
This note was uploaded on 12/19/2011 for the course M E 366l taught by Professor Staff during the Spring '08 term at University of Texas at Austin.
- Spring '08