fundamental-engineering-optimization-methods.pdf

# In order to develop more general optimality criteria

• 162

This preview shows pages 49–52. Sign up to view the full content.

and may not always be feasible. In order to develop more general optimality criteria, we follow Lagrange’s approach to the problem and consider the variation in the objective and constraint functions at a stationary point, given as: ݂݀ ൌ ߲݂ ߲ݔ ݀ݔ ൅ ڮ ൅ ߲݂ ߲ݔ ݀ݔ ൌ Ͳ (4.5) ݄݀ ൌ ߲݄ ߲ݔ ݀ݔ ൅ ڮ ൅ ߲݄ ߲ݔ ݀ݔ ൌ Ͳ We now combine these two conditions via a scalar weight (Lagrange multiplier, λ ) to write: ߲݂ ߲ݔ ൅ ߣ ߲݄ ߲ݔ ቇ ݀ݔ ௝ୀଵ ൌ Ͳ (4.6) Since variations ݀ݔ are independent, the above condition implies that: డ௙ డ௫ ൅ ߣ డ௛ డ௫ ൌ Ͳǡ ݆ ൌ ͳǡ ǥ ǡ ݊ .

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

Download free eBooks at bookboon.com Fundamental Engineering Optimization Methods 50 Mathematical Optimization We further note that application of FONC to a Lagrangian function defined as: ࣦሺ࢞ǡ ߣሻ ൌ ݂ሺ࢞ሻ ൅ ߣ݄ሺ࢞ሻ also gives rise to the above condition. For multiple equality constraints, the Lagrangian function is similarly formulated as: ࣦሺ࢞ǡ ࣅሻ ൌ ݂ሺ࢞ሻ ൅ ෍ ߣ ݄ ሺ࢞ሻ ௜ୀଵ (4.7) Then, in order for ݂ሺ࢞ሻ to have a local minimum at x *, the following FONC must be satisfied: ߲ࣦ ߲ݔ ߲݂ ߲ݔ ൅ ෍ ߣ ߲݄ ߲ݔ ݔ ௜ୀଵ ൌ ͲǢ ݆ ൌ ͳǡ ǥ ǡ ݊ (4.8) ݄ ሺ࢞ሻ ൌ Ͳǡ ݅ ൌ ͳǡ ǥ ǡ ݈ The above FONC can be equivalently stated as: ׏ ࣦሺ࢞ כ ǡ ࣅ כ ሻ ൌ Ͳǡ ׏ ࣦሺ࢞ כ ǡ ࣅ כ ሻ ൌ Ͳ These conditions suggest that ࣦሺ࢞ כ ǡ ࣅ כ is stationary with respect to both x and λ ; therefore, minimization of ࣦሺ࢞ǡ ࣅሻ amounts to an unconstrained optimization problem. Further, the Lagrange Multiplier Theorem (Arora, p.135) states that if x * is a regular point (defined below) then the FONC result in a unique solution to R ߣ כ ² We note that the above FONC further imply: ׏ ݂ሺ࢞ כ ሻ ൌ െ σ ߣ ׏݄ ሺ࢞ כ ௜ୀଵ ² Algebraically, it means that the cost function gradient is a linear combination of the constraint gradients. Geometrically, it means that the negative of the cost function gradient lies in the convex cone spanned by the constraint normals (Sec. 4.3.5). SOSC for equality constrained problems are given as: ׏ ࣦሺ࢞ כ ǡ ࣅ כ ሻ ൌ ׏ ݂ሺ࢞ כ ሻ ൐ Ͳ ² Further discussion on SOC for constrained optimization problems is delayed till Sec. 4.4.3. An example is now presented to explain the optimization process for equality constrained problems. Example 4.3: We consider the following optimization problem: ǡ௫ ݂ሺݔ ǡ ݔ ሻ ൌ െݔ ݔ Subject to: ݄ሺݔ ǡ ݔ ሻ ൌ ݔ ൅ ݔ െ ͳ ൌ Ͳ
Download free eBooks at bookboon.com Fundamental Engineering Optimization Methods 51 Mathematical Optimization We first note that the equality constraint can be used to develop an unconstrained problem in one variable, given as: ݂ሺݔ ሻ ൌ െݔ

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

This is the end of the preview. Sign up to access the rest of the document.
• Winter '17
• sam

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern